提出 #19425685

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template <class T> using V = vector<T>;
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<class T> bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
struct in { template <class T> operator T() { T t; std::cin >> t; return t; } };
const int INF = 1e9+7;
const ll LINF = 1LL << 60;
int dx[8] = {0,1,0,-1,1,1,-1,-1};
int dy[8] = {1,0,-1,0,1,-1,1,-1};

auto solve() {
   int n = in();
   vector<int> a(n), b(n);
   rep(i,n) {
      a[i] = in();
      b[i] = in();
   }
   sort(all(a));
   sort(all(b));
   int ans = 0;
   if (n % 2 == 0) {
      ans = (b[n/2] + b[n/2-1] - a[n/2] - a[n/2-1]) + 1;
   } else {
      ans =  b[n/2] - a[n/2] + 1;
   }
   return ans;
}

int main() {
   ios::sync_with_stdio(false);
   cin.tie(0);

   cout << solve() << endl;
}

提出情報

ジャッジ結果