fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. // Speed
  5. #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  6.  
  7. // Typedefs
  8. #define int long long
  9. #define pb push_back
  10. #define ff first
  11. #define ss second
  12. #define all(x) (x).begin(), (x).end()
  13. #define rall(x) (x).rbegin(), (x).rend()
  14. #define sz(x) ((int)(x).size())
  15. #define endl '\n'
  16. #define yes cout << "yes\n"
  17. #define no cout << "no\n"
  18.  
  19. // Loops
  20. #define rep(i,a,b) for(int i=a;i<b;++i)
  21. #define per(i,a,b) for(int i=b-1;i>=a;--i)
  22. #define each(x, a) for (auto& x : a)
  23.  
  24. // Consts
  25. const int INF = 1e18;
  26. const int MOD = 676767677;
  27. const int N = 2e5 + 5;
  28.  
  29. // Math
  30. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  31. int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
  32.  
  33. int power(int a, int b, int m = MOD) {
  34. int res = 1;
  35. while (b > 0) {
  36. if (b & 1) res = res * a % m;
  37. a = a * a % m;
  38. b >>= 1;
  39. }
  40. return res;
  41. }
  42.  
  43. int modinv(int a, int m = MOD) {
  44. return power(a, m - 2, m);
  45. }
  46.  
  47. // Logic
  48. void solve() {
  49. // Code
  50. int n;
  51. cin>>n;
  52. vector<int> a(n);
  53. int max1=0;
  54. rep(i,0,n){
  55. cin>>a[i];
  56. max1=max(a[i],max1);
  57. }
  58. unordered_set<int> s(a.begin(), a.end());
  59. int flag=0;
  60. rep(i,5,n){
  61. if(s.count(i)==0) {
  62. flag=i;
  63. break;
  64. }
  65. }
  66. if(n<4){
  67. cout<<min(max1+1,n)<<endl;
  68. }
  69. else{
  70. if(flag==0) cout<<n<<endl;
  71. else cout<<flag<<endl;
  72. }
  73.  
  74. }
  75.  
  76. // Main
  77. int32_t main() {
  78. fast_io;
  79.  
  80. int t;
  81. cin >> t;
  82. while (t--) {
  83. solve();
  84. }
  85.  
  86. return 0;
  87. }
  88.  
Success #stdin #stdout 0.01s 5312KB
stdin
4
4
0 1 2 3
2
6 7
6
8 1 7 6 4 3
9
9 9 8 2 4 4 3 5 3
stdout
4
2
5
6