Files
contests/Codeforces/CodeforcesRound1034(Div3)/EMEXCount/solution.cpp

32 lines
421 B
C++

#include "iostream"
#include <map>
using namespace std;
void solve() {
int n, x;
cin >> n;
map<int, int> hash_map;
for (int i = 0; i < n; i++) {
cin >> x;
if (hash_map.count(x) == 0)
hash_map[x] = 1;
else
hash_map[x]++;
}
for (int k = 0; k <= n; k++) {
int cur_mex = 0;
for (auto &i : hash_map) {
}
}
}
int main() {
int t;
cin >> t;
while (t--)
solve();
}