fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define read(type) readInt<type>() // Fast read
  4. #define ll long long
  5. #define nL "\n"
  6. #define pb push_back
  7. #define mk make_pair
  8. #define pii pair<int, int>
  9. #define a first
  10. #define b second
  11. #define vi vector<int>
  12. #define all(x) (x).begin(), (x).end()
  13. #define umap unordered_map
  14. #define uset unordered_set
  15. #define MOD 1000000007
  16. #define imax INT_MAX
  17. #define imin INT_MIN
  18. #define exp 1e9
  19. #define sz(x) (int((x).size()))
  20.  
  21.  
  22. void solve() {
  23. int n; cin >> n;
  24. map<ll,ll> d;
  25.  
  26. for(auto i = 0; i < n; i++) {
  27. ll o; cin >> o;
  28. if (d.find(o) != d.end()) {
  29. d[o]++;
  30. } else {d[o] = 1;}
  31. }
  32.  
  33. int ans = 1;
  34. cout << "Entering" << endl;
  35.  
  36.  
  37. pair<ll,ll> cur = *d.begin();
  38. cout << cur.a << endl;
  39.  
  40. d.erase(d.begin());
  41. // while((int)d.size() != 0) {
  42. // if (find(all(d), cur+1) != d.end()) {
  43. // d[cur+1]--;
  44. // if (d[cur+1] == 0) {d.erase(cur+1);}
  45. // cur = cur+1;
  46. // } else {
  47. // ans++;
  48. // // auto curItt = *d.begin();
  49. // // cur = curItt.a;
  50.  
  51. // d[cur+1]--;
  52. // if (d[cur+1] == 0) {d.erase(cur+1);}
  53. // }
  54. // }
  55.  
  56. cout << ans << endl;
  57.  
  58. }
  59.  
  60.  
  61.  
  62. int32_t main()
  63. {
  64. ios_base::sync_with_stdio(false);
  65. cin.tie(NULL);
  66. int t; cin >> t;
  67. while (t--) {
  68. solve();
  69. }
  70. return 0;
  71. }
Success #stdin #stdout 0.01s 5520KB
stdin
10
6
2 2 3 4 3 1
5
11 8 7 10 9
6
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
8
1 1 4 4 2 3 2 3
6
1 2 3 2 3 4
7
10 11 11 12 12 13 13
7
8 8 9 9 10 10 11
8
4 14 5 15 6 16 7 17
8
5 15 6 14 8 12 9 11
5
4 2 2 3 4
stdout
Entering
1
1
Entering
7
1
Entering
1000000000
1
Entering
1
1
Entering
1
1
Entering
10
1
Entering
8
1
Entering
4
1
Entering
5
1
Entering
2
1