Submission #2147003

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1LL<<60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main(){
  int n;
  cin >> n;
  int a[n];
  REP(i, n) cin >> a[i];
  sort(a, a+n);
  if(a[n-1] - a[0] > 1){
    cout << "No" << endl;
    return 0;
  }
  int M = 0, N;
  N = a[n-1];
  while(a[M] == (N-1)) M++;
  if(M <= (N-1) && (2*N-M) <= n) cout << "Yes" << endl;
  else if(M == 0 && N == (n-1)) cout << "Yes" << endl;
  else cout << "No" << endl; 
	return 0;
}

Submission Info

Judge Result