#include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; typedef long double db; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; VI cnt(n); FOR(i, 0, n) { int x; cin >> x; x--; cnt[x]++; } sort(ALL(cnt), greater()); int s = 0; FOR(i, 0, n) { s += cnt[i]; if (s - (i + 1) >= n - s) { cout << i + 1 << "\n"; return 0; } } assert(false); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | #include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; typedef long double db; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; VI cnt(n); FOR(i, 0, n) { int x; cin >> x; x--; cnt[x]++; } sort(ALL(cnt), greater()); int s = 0; FOR(i, 0, n) { s += cnt[i]; if (s - (i + 1) >= n - s) { cout << i + 1 << "\n"; return 0; } } assert(false); return 0; } |