#include <bits/stdc++.h> using namespace std; constexpr int M = 5e5+7; int n; int a[M]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i=1; i<=n; i++){ int act; cin >> act; a[act]++; } vector<int> v; for(int i=1; i<=n; i++){ if(a[i]) v.push_back(a[i]); } sort(v.begin(), v.end()); int tmp = 0; int ans = 0; while(tmp < n){ int last = v.back(); v.pop_back(); tmp += last + last-1; ans++; } cout << ans << '\n'; 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 | #include <bits/stdc++.h> using namespace std; constexpr int M = 5e5+7; int n; int a[M]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i=1; i<=n; i++){ int act; cin >> act; a[act]++; } vector<int> v; for(int i=1; i<=n; i++){ if(a[i]) v.push_back(a[i]); } sort(v.begin(), v.end()); int tmp = 0; int ans = 0; while(tmp < n){ int last = v.back(); v.pop_back(); tmp += last + last-1; ans++; } cout << ans << '\n'; return 0; } |