提出 #76272391

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
 
int main() {
   int n,m;
   cin >> n >> m;
   vector<long long> A(n);
   vector<long long> B(m);
   for(int i = 0; i < n; i ++) cin >> A[i];
   for(int i = 0; i < m; i ++) cin >> B[i];

   sort(A.begin(),A.end());
   sort(B.begin(),B.end());

   int sushi = 0;
   int j = 0;
   int start = 0;
   bool search = true;

   for(int i = 0; i < n; i ++){
    search = true;
    while(j < m && A[i] * 2 >= B[j]){
            sushi ++;
            j++;
            start = j;
            search = false;
            break;
    }
    if(search == true) j = start;
    
   }
cout << sushi << endl;
}

提出情報

ジャッジ結果