#include <bits/stdc++.h>
using namespace std;
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<int> tab={0};
int n;
cin>>n;
tab.resize(n+1);
for(int i=0;i<n;i++){
int a;
cin>>a;
tab[a]++;
}
sort(tab.begin(),tab.end(),greater<int>());
int x=0,pointer=n;
for(int i=0;i<=n;i++)
{int y=tab[i];
int z=tab[i];
while((y&&pointer-i)){
if(y>tab[pointer]&&z-tab[pointer]){
y-=tab[pointer];
tab[pointer]=0;
pointer--;
}
else{
tab[pointer]-=y-1;
y=0;
}
}
tab[i]=0;
x++;
if(!(pointer-i))
{
cout<<x;
return 0;
}
}
cout<<x;
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 46 47 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); vector<int> tab={0}; int n; cin>>n; tab.resize(n+1); for(int i=0;i<n;i++){ int a; cin>>a; tab[a]++; } sort(tab.begin(),tab.end(),greater<int>()); int x=0,pointer=n; for(int i=0;i<=n;i++) {int y=tab[i]; int z=tab[i]; while((y&&pointer-i)){ if(y>tab[pointer]&&z-tab[pointer]){ y-=tab[pointer]; tab[pointer]=0; pointer--; } else{ tab[pointer]-=y-1; y=0; } } tab[i]=0; x++; if(!(pointer-i)) { cout<<x; return 0; } } cout<<x; return 0; } |
English