#include <iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n, a; cin >> n; vector<int> nums(n, 0); for (int i = 0; i < n; i++) { cin >> a; nums[a-1]++; } sort(nums.begin(), nums.end()); int sum = 0; int ans = 0; int i = n-1; while (sum < n) { sum += nums[i]*2-1; ans++; i--; } cout << ans; 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 | #include <iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n, a; cin >> n; vector<int> nums(n, 0); for (int i = 0; i < n; i++) { cin >> a; nums[a-1]++; } sort(nums.begin(), nums.end()); int sum = 0; int ans = 0; int i = n-1; while (sum < n) { sum += nums[i]*2-1; ans++; i--; } cout << ans; return 0; } |