Submission #1359979

---

Source Code Expand

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill(x, y) memset(x, y, sizeof x)
#define copy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair < int, int > pa;

inline int read()
{
	int sc = 0, f = 1; char ch = getchar();
	while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') sc = sc * 10 + ch - '0', ch = getchar();
	return sc * f;
}

const int MAXN = 100005;

int n, a[MAXN], c;

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	n = read();
	for (int i = 1; i <= n; i ++) a[i] = read();
	sort(a + 1, a + n + 1);
	if (a[n] - a[1] > 1) return puts("No"), 0;
	if (a[1] == a[n])
	{
		if (a[1] == n - 1) return puts("Yes"), 0;
		if ((a[1] << 1) <= n) return puts("Yes"), 0;
		return puts("No"), 0;
	}
	for (int i = 1; i <= n; i ++) if (a[i] == a[1]) c ++;
	if (c + (a[n] - c << 1) <= n && c < a[n]) return puts("Yes"), 0;
	return puts("No"), 0;
}

Submission Info

Judge Result