#include <bits/stdc++.h>
#define ndl '\n'
#define ll long long
#define INF 1000000007
#define st first
#define nd second
#define debug(x) cout << #x << ": " << x << ndl
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
map<int,int> mapa;
for(int i=0;i<n;i++) {
int tmp; cin>>tmp;
mapa[tmp]++;
}
vector<pair<int,int>> A;
for(auto [a, b]: mapa)
A.push_back({b, a});
sort(A.rbegin(), A.rend());
int sum = 0;
for(int i=1;i<=A.size();i++) {
sum += (A[i-1].st - 1) * 2 + 1;
if(sum >= n) {
cout<<i;
return 0;
}
}
cout<<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 41 42 43 44 | #include <bits/stdc++.h> #define ndl '\n' #define ll long long #define INF 1000000007 #define st first #define nd second #define debug(x) cout << #x << ": " << x << ndl #define pb push_back #define pob pop_back #define pf push_front #define pof pop_front #define lb lower_bound #define ub upper_bound #define all(x) (x).begin(), (x).end() using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; map<int,int> mapa; for(int i=0;i<n;i++) { int tmp; cin>>tmp; mapa[tmp]++; } vector<pair<int,int>> A; for(auto [a, b]: mapa) A.push_back({b, a}); sort(A.rbegin(), A.rend()); int sum = 0; for(int i=1;i<=A.size();i++) { sum += (A[i-1].st - 1) * 2 + 1; if(sum >= n) { cout<<i; return 0; } } cout<<n; return 0; } |
English