#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define nd second
#define st first
#define sz size
#define forr(i, n) for(int i=1;i<=n;i++)
const ll infl=1e18+90;
const int inf=1e9+90;
const int roz=1e6+39;
int ile[roz];
vector<int> wek;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
ile[a]++;
}
for(int i=n;i>=1;i--)
{
if(ile[i]!=0) wek.pb(-ile[i]);
}
sort(wek.begin(), wek.end());
int wyn=0;
for(auto it:wek)
{
wyn++;
n+=(2*it+1);
if(n<=0) break;
}
cout<<wyn<<"\n";
}
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 | #include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define ld long double #define pb push_back #define nd second #define st first #define sz size #define forr(i, n) for(int i=1;i<=n;i++) const ll infl=1e18+90; const int inf=1e9+90; const int roz=1e6+39; int ile[roz]; vector<int> wek; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin>>n; for(int i=1;i<=n;i++) { int a; cin>>a; ile[a]++; } for(int i=n;i>=1;i--) { if(ile[i]!=0) wek.pb(-ile[i]); } sort(wek.begin(), wek.end()); int wyn=0; for(auto it:wek) { wyn++; n+=(2*it+1); if(n<=0) break; } cout<<wyn<<"\n"; } |
English