Submission #1359983

---

Source Code Expand

#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

int n;
int a[100000];

int main() {
	ios_base::sync_with_stdio(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	
	sort(a, a + n);
	if (a[n - 1] - a[0] > 1) {
		cout << "No";
		return 0;
	}
	
	int cnt1 = 0;
	for (int i = 0; i < n; i++) {
		if (a[i] == a[0]) cnt1++;
	}
	
	if (cnt1 == n) {
		if (a[0] * 2 <= n || a[0] == n - 1) {
			cout << "Yes";
		} else {
			cout << "No";
		}
	} else {
		int cnt2 = n - cnt1;
		int among2 = a[n - 1] - cnt1;
		if (among2 >= 1 && among2 * 2 <= cnt2) {
			cout << "Yes";
		} else {
			cout << "No";
		}
	}
	
	return 0;
}

Submission Info

Judge Result