Submission #1359985

---

Source Code Expand

//in the name of allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int , int> ii;
const int MAXN = 1e5+10;
int a[MAXN] , n;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	for(int i=0 ; i<n ; i++)
		cin >> a[i];
	int mn = *min_element(a , a+n) , mx = *max_element(a , a+n);
	if(mx-mn > 1){
		cout << "No\n";
		return 0;
	}
	if(mx == mn){
		if(a[0] * 2 > n && a[0] != n-1)
			cout << "No\n";
		else
			cout << "Yes\n";
		return 0;
	}
	int t=0 , all=0;
	for(int i=0 ; i<n ; i++)
		if(a[i] == mn)
			t ++;
	for(int i=0 ; i<n ; i++){
		if(a[i] == mx)
			all = a[i]; 
	}
	if(all <= t){
		cout << "No\n";
		return 0;
	}
	if((n-t) < (all-t)*2){
		cout << "No\n";
		return 0;
	}
	cout << "Yes\n";
}

//.

Submission Info

Judge Result