Submission #2170922

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
const int INF=1<<17;


int main(){
    int N;
    cin >> N;
    int maxi=0,mini=INF;
    map<int,int> mp;
    for(int i=0;i<N;i++){
        int x;
        cin >> x;
        mp[x]++;
        maxi=max(maxi,x);
        mini=min(mini,x);
    }
    if(maxi-mini>1) puts("No");
    else if(maxi-mini==1){
        if(mp[mini]>=mini) puts("No");
        else if(mini-mp[mini]<mp[maxi]/2) puts("Yes");
        else puts("No");
    }
    else{
        if(maxi==N-1) puts("Yes");
        else if(1<=maxi&&maxi<=N/2) puts("Yes");
        else puts("No");
    }
    return 0;
}

Submission Info

Judge Result