#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) #endif #define x first #define y second #define ir(a, x, b) ((a) <= (x) && (x) <= (b)) #define vec vector #define rep(i, a, b) for (int i = a; i < (b); ++i) #define all(x) (x).begin(), (x).end() using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vec<int> a(n); rep(i,0,n) { cin >> a[i]; } sort(all(a)); int ct = 1; vec<int> cts; rep (i, 1, n) { if (a[i] != a[i-1]) { cts.push_back(ct); ct = 0; } ct++; } cts.push_back(ct); sort(all(cts), greater<int>()); debug(cts); int s = 0; rep (i, 0, cts.size()) { s += 2*cts[i]-1; if (s >= n) { cout << i+1 << "\n"; return 0; } } 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 48 49 50 | #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) #endif #define x first #define y second #define ir(a, x, b) ((a) <= (x) && (x) <= (b)) #define vec vector #define rep(i, a, b) for (int i = a; i < (b); ++i) #define all(x) (x).begin(), (x).end() using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vec<int> a(n); rep(i,0,n) { cin >> a[i]; } sort(all(a)); int ct = 1; vec<int> cts; rep (i, 1, n) { if (a[i] != a[i-1]) { cts.push_back(ct); ct = 0; } ct++; } cts.push_back(ct); sort(all(cts), greater<int>()); debug(cts); int s = 0; rep (i, 0, cts.size()) { s += 2*cts[i]-1; if (s >= n) { cout << i+1 << "\n"; return 0; } } return 0; } |