-
Notifications
You must be signed in to change notification settings - Fork 0
/
A.cpp
64 lines (58 loc) · 1.28 KB
/
A.cpp
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// Problem : A. Subset Mex
// Contest : Codeforces - Codeforces Round #670 (Div. 2)
// URL : https://codeforces.com/contest/1406/problem/A
// Memory Limit : 512 MB
// Time Limit : 1000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const int MAX = 107;
const int MOD = 1000000007;
void solve() {
int n;
cin >> n;
int cnt[MAX] = {0}, t;
for (int i = 0; i < n; i++) {
cin >> t;
cnt[t]++;
}
int small = 0, big = 0;
for (int i = 0; i <= 101; i++) {
if (cnt[i] == 1) {
small = i;
for (int j = i + 1; j <= 101; j++) {
if (cnt[j] == 0) {
big = j; break;
}
}
break;
}
else if (cnt[i] == 0) {big = i; small = i; break;}
}
cout << big + small << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("in.in", "r", stdin); freopen("out.out", "w", stdout);
int tt; cin >> tt; for (int i = 1; i <= tt; i++) {solve();}
//solve();
}