Submission #76261609

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LONGMAX 1e18
#define INTMAX 2147483647

int main(void)
{
    ll N, M;
    cin >> N >> M;
    priority_queue<ll, vector<ll>, greater<ll>> A, B;
    for (ll i = 0; i < N; i++)
    {
        ll Ai;
        cin >> Ai;
        A.push(Ai);
    }
    for (ll i = 0; i < M; i++)
    {
        ll Bi;
        cin >> Bi;
        B.push(Bi);
    }
    ll ans = 0;
    while (A.size() != 0 && B.size() != 0)
    {
        // cout << A.size() << endl;
        // cout << A.top() << endl;
        // cout << B.top() << endl;
        // B (ネタ) が A (シャリ) の二倍以下の重さならOK
        if (A.top() * 2 >= B.top())
        {
            // cout << "pop" << endl;
            A.pop();
            B.pop();
            ans++;
        }
        else
        {
            // A (シャリ) が小さすぎた
            A.pop();
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result