fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n, int m){
  34.  
  35. sort(begin(a), end(a));
  36. sort(begin(b), end(b));
  37.  
  38. int ct = 0;
  39.  
  40. int i = 0, j = 0;
  41. while(i<n && j<m){
  42.  
  43. while(i<n && a[i] <= b[j]) i++;
  44. if(i==n) break;
  45.  
  46. ct++;
  47. i++;
  48. j++;
  49. }
  50.  
  51. return ct;
  52. }
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68. int practice(int n, int m){
  69.  
  70.  
  71. return 0;
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n, m;
  81. cin>> n >> m;
  82.  
  83. a.resize(n);
  84. b.resize(m);
  85. for(int i=0; i<n; i++) cin >> a[i];
  86. for(int i=0; i<m; i++) cin >> b[i];
  87.  
  88. cout << consistency(n, m) << endl;
  89.  
  90.  
  91. }
  92.  
  93.  
  94.  
  95.  
  96.  
  97. int32_t main() {
  98. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  99.  
  100. int t = 1;
  101. cin >> t;
  102. while (t--) {
  103. solve();
  104. }
  105.  
  106. return 0;
  107. }
Success #stdin #stdout 0s 5280KB
stdin
2
3 3
1 2 3
1 2 1
9 9
9 8 7 7 6 5 4 3 3
1 2 5 5 6 7 8 9 9
stdout
2
7