#include<bits/stdc++.h> using namespace std; const int s = 500'001; int tab[s]; vector<int>v; void f() { int n, ans = 0; cin >> n; int sizee = n; for (int i = 0; i < n; i ++){ int x; cin >> x; tab[x]++; } for (int i = 1; i <= n; i ++){ if (tab[i] != 0) v.push_back(tab[i]); } sort(v.begin(), v.end()); for (int i = v.size() - 1; i >= 0; i--){ ans ++; sizee -= v[i] * 2; sizee ++; if (sizee <= 0){ cout << ans; return; } } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); f(); 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 | #include<bits/stdc++.h> using namespace std; const int s = 500'001; int tab[s]; vector<int>v; void f() { int n, ans = 0; cin >> n; int sizee = n; for (int i = 0; i < n; i ++){ int x; cin >> x; tab[x]++; } for (int i = 1; i <= n; i ++){ if (tab[i] != 0) v.push_back(tab[i]); } sort(v.begin(), v.end()); for (int i = v.size() - 1; i >= 0; i--){ ans ++; sizee -= v[i] * 2; sizee ++; if (sizee <= 0){ cout << ans; return; } } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); f(); return 0; } |