#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); int n; cin>>n; vector<int> occ(n+1); for(int i=0;i<n;i++){ int a; cin>>a; occ[a]++; } sort(occ.begin(), occ.end()); int small = 0; int res = 0; for(int i=n;i>=0;i--){ if(occ[i] == 0) continue; res++; int sum = 0; while(small < i && sum+occ[small] < occ[i]){ sum += occ[small]; occ[small] = 0; small++; } if(small < i){ int cnt = occ[i]-sum-1; occ[small] -= cnt; } occ[i] = 0; } cout<<res<<endl; }
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 | #include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); int n; cin>>n; vector<int> occ(n+1); for(int i=0;i<n;i++){ int a; cin>>a; occ[a]++; } sort(occ.begin(), occ.end()); int small = 0; int res = 0; for(int i=n;i>=0;i--){ if(occ[i] == 0) continue; res++; int sum = 0; while(small < i && sum+occ[small] < occ[i]){ sum += occ[small]; occ[small] = 0; small++; } if(small < i){ int cnt = occ[i]-sum-1; occ[small] -= cnt; } occ[i] = 0; } cout<<res<<endl; } |