Submission #2376709

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
 
#define rep(i, a, b) for(ll (i) = (a); (i) < (b);++i)

ll gcd(ll x, ll y)
{
  if (x % y == 0)
  {
    return y;
  }
  return gcd(y, x % y);
}

int main()
{
  ll L, H, N;
  cin >> L >> H >> N;
  ll A[N];
  for (int i = 0; i < N; ++i){
    cin >> A[i];
  }

  for (int i = 0; i < N; ++i)
  {
    if (A[i] < L){
      cout << L - A[i] << endl;
      return 0;
    }else if (H < A[i]){
      cout << -1 << endl;
      return 0;
    }else{
      cout << 0 << endl;
      return 0;
    }
  }
  return 0;
}

Submission Info

Judge Result