Problem: 2061D - Kevin and Numbers
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define aa(z) int z; cin >> z
#define vi vector<int>
#define f(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define in(arr, n) for (int i = 0; i < n; i++) cin >> arr[i]
#define out(arr, n) for (int i = 0; i < n; i++) cout << arr[i] << " "; cout << endl
#define srt(v) sort(v.begin(), v.end())
#define srtr(v) sort(v.begin(), v.end(), greater<int>())
#define err cout << fixed << setprecision(10)
#define lb(arr, d) lower_bound(arr, arr + n, d) - arr
const int mod = 998244353;

void mohammaad_rafi() {
    aa(n);
    aa(m);
    vi a(n), b(m);
    in(a, n);
    in(b, m);

    map<int, int> mp;
    srt(a);
    srt(b);

    // Populate the map with elements of `a`
    for (int x : a) {
        mp[x]++;
    }

    int i = 0;
    while (i < m) {
        if (mp.find(b[i]) != mp.end() && mp[b[i]] >= 1) {
            // Exact match found
            mp[b[i]]--;
            if (mp[b[i]] == 0) {
                mp.erase(b[i]);
            }
            i++;
        } else if (mp.find(b[i] / 2) != mp.end() && mp.find(b[i] / 2 + 1) != mp.end() &&
                   b[i] % 2 != 0 && mp[b[i] / 2] >= 1 && mp[b[i] / 2 + 1] >= 1) {
            // Combine two smaller elements to form `b[i]` (odd case)
            mp[b[i] / 2]--;
            mp[b[i] / 2 + 1]--;
            if (mp[b[i] / 2] == 0) {
                mp.erase(b[i] / 2);
            }
            if (mp[b[i] / 2 + 1] == 0) {
                mp.erase(b[i] / 2 + 1);
            }
            i++;
        }
        else if (mp.find(b[i] / 2) != mp.end() && b[i] % 2 == 0 && mp[b[i] / 2] >= 2) {
            // Combine two smaller elements to form `b[i]` (even case)
            mp[b[i] / 2] -= 2;
            if (mp[b[i] / 2] == 0) {
                mp.erase(b[i] / 2);
            }
            i++;
        }  else {
            // Try to create `b[i]` by combining smaller elements
          
            auto it = mp.begin();
            while (!mp.empty() && it->first < b[i]) {
            //       cout<<"map"<<endl;
            // for(auto it=mp.begin();it!=mp.end();it++){
            //     cout<<it->first<<" "<<it->second<<endl;
            // }
                int key = it->first;
                if (mp.find(key + 1) != mp.end() && mp[key + 1] >= 1) {
                    // Combine `key` and `key + 1` to form `key + key + 1`
                    mp[key]--;
                    mp[key + 1]--;
                    if (mp[key] == 0) {
                        mp.erase(key);
                    }
                    if (mp[key + 1] == 0) {
                        mp.erase(key + 1);
                    }

                    // Add the combined element
                    mp[key + key + 1]++;
                }
                
               else if (mp.find(key ) != mp.end() && mp[key ] >= 2) {
                    // Combine `key` and `key + 1` to form `key + key + 1`
                    mp[key]--;
                    mp[key ]--;
                     mp[key + key]++;
                    if (mp[key] == 0) {
                        mp.erase(key);
                    }
                    // if (mp[key ] == 0) {
                    //     mp.erase(key 1);
                    // }

                    // Add the combined element
                    
                }

                 else {
                    // No valid combination can be made
                    break;
                }

                // Update iterator after potential erasures
                it = mp.begin();
            }

            // After trying, check if `b[i]` can be satisfied
            it = mp.begin();
            if (mp.empty() || it->first != b[i]) {
                cout << "NO" << endl;
                return;
            }
        }
    }
    if(mp.size()!=0){
        cout<<"No"<<endl;return;
    }

    cout << "YES" << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    aa(t); // Number of test cases
    while (t--) {
        mohammaad_rafi();
    }
    return 0;
}


Submission (verdict: Accepted):
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define aa(z) int z; cin >> z
#define vi vector<int>
#define f(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define in(arr, n) for (int i = 0; i < n; i++) cin >> arr[i]
#define out(arr, n) for (int i = 0; i < n; i++) cout << arr[i] << " "; cout << endl
#define srt(v) sort(v.begin(), v.end())
#define srtr(v) sort(v.begin(), v.end(), greater<int>())
#define err cout << fixed << setprecision(10)
#define lb(arr, d) lower_bound(arr, arr + n, d) - arr
const int mod = 998244353;
/// heyyyy pravesshhhhhh from mirzaaapurrrr  how areee youuuuuuuuuu thanks for giving me hint 
void mohammaad_rafi() {
    aa(n);
    aa(m);
    vi a(n), b(m);
    in(a, n);
    in(b, m);
    map<int,int> mpa,mpb;
    f(i,n){
        mpa[a[i]]++;
    }
   f(i,m){
        mpb[b[i]]++;
    }

while(mpa.size()>0&&mpb.size()>0){
auto it=mpb.begin();
int key=it->first;
mpb[key]--;
if(mpb[key]==0){
    mpb.erase(key);
}
while(mpa.find(key)==mpa.end()){
    auto kt=mpa.begin();
    if(key<kt->first){
        cout<<"No"<<endl;return;
    }
    if(key%2==0){
mpb[key/2]++;
key=key/2;
    }
    else{
mpb[key/2+1]++;
key=key/2;

    }


}

if(mpa.find(key)!=mpa.end()){
    mpa[key]--;

    if(mpa[key]==0){
    mpa.erase(key);
}
    
}
else{
    break;
}


}


if(mpa.size()==0&&mpb.size()==0){
    cout<<"Yes"<<endl;
}
else{
       cout<<"No"<<endl;
}





}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    aa(t); // Number of test cases
    while (t--) {
        mohammaad_rafi();
    }
    return 0;
}