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.  
  17. // Loops
  18. #define rep(i,a,b) for(int i=a;i<b;++i)
  19. #define each(x, a) for (auto &x : a)
  20.  
  21. int distinct_count(vector<int> &v) {
  22. unordered_set<int> st(all(v));
  23. return st.size();
  24. }
  25.  
  26. // Logic
  27. void solve() {
  28. int n;
  29. cin>>n;
  30. vector <int> a(n);
  31. unordered_map<int,int> freq;
  32. rep(i,0,n) {
  33. cin>>a[i];
  34. freq[a[i]]++;
  35. }
  36. int count=0;
  37. sort(all(a));
  38. for(int i=0;i<n;i=i+freq[a[i]]){
  39. if(freq[a[i]]<a[i]) continue;
  40. else count=count+freq[a[i]];
  41. }
  42. cout<<n-count<<endl;
  43. }
  44.  
  45.  
  46. // Main
  47. int32_t main() {
  48. fast_io;
  49. int t;
  50. cin>>t;
  51. while (t--) solve();
  52. return 0;
  53. }
  54.  
Success #stdin #stdout 0.01s 5280KB
stdin
4
3
1 2 2
5
1 1 2 2 3
10
1 2 3 2 4 4 4 4 5 2
1
0
stdout
0
1
2
0