Submission #2176661

---

Source Code Expand

#include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;

int main() {
  int N;
  cin >> N;
  vector<int> cnt(N, 0);
  int mn = N, mx = 0;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    ++cnt[a];
    mn = min(mn, a);
    mx = max(mx, a);
  }
  bool res = false;
  if (mx - mn <= 1) {
    if (mx == mn) {
      res |= mx == N - 1;
      res |= N >= 2 * mx;
    } else {
      int k = mx, u = cnt[mn];
      if (k > u) {
        res |= N - u >= 2 * (k - u);
      }
    }
  }
  cout << (res ? "Yes" : "No") << endl;
  return 0;
}

Submission Info

Judge Result