![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/91119df2e10b5d0bcb3e6455c45a13ad.png)
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y); memset(x,y,sizeof(x))
#define mv 2147483648+30
using namespace std;
ll gar(ll a,ll b){
return b==0?a:gar(b,a%b);
}
ll a[200030],b[200030];
int main(){
ll n;
while(cin>>n){
while(n--){
ll m,k=0;mes(a,0);
cin>>m;
for(ll i=0;i<m;i++){
cin>>a[i];
}
sort(a,a+m);
for(int i=0;i<m;i++){
if(a[i]!=a[i-1]||i==0){
b[k++]=a[i];
}
}
ll flag=1;
for(ll i=0;i<=m;i++){
if(b[i]!=i){
cout<<i<<endl;break;
}
}
}
}
}