#if defined(EMBE_DEBUG) && !defined(NDEBUG) #include "embe-debug.hpp" #else #define LOG_INDENT(...) do {} while (false) #define LOG(...) do {} while (false) #define DUMP(...) do {} while (false) #endif #include <iostream> #include <vector> #include <algorithm> #include <ranges> using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> counts(n + 1); for (int i = 0; i < n; ++i) { int x; cin >> x; ++counts[x]; } ranges::sort(counts); int res = 0; int covered = 0; for (int c: counts | views::reverse) { if (covered >= n) break; if (c > 0) { covered += 2 * c - 1; ++res; } } cout << res << endl; 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 | #if defined(EMBE_DEBUG) && !defined(NDEBUG) #include "embe-debug.hpp" #else #define LOG_INDENT(...) do {} while (false) #define LOG(...) do {} while (false) #define DUMP(...) do {} while (false) #endif #include <iostream> #include <vector> #include <algorithm> #include <ranges> using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> counts(n + 1); for (int i = 0; i < n; ++i) { int x; cin >> x; ++counts[x]; } ranges::sort(counts); int res = 0; int covered = 0; for (int c: counts | views::reverse) { if (covered >= n) break; if (c > 0) { covered += 2 * c - 1; ++res; } } cout << res << endl; return 0; } |