题解 | 打牌

#include <iostream>
#include <vector>
using namespace std;
void solve()
{
    int a,b,aw=0,bw=0;
    cin>>a>>b;
    vector <long long> A(a);
    vector <long long> B(b);
    for(int i=0;i<a;i++) cin>>A[i];
    for(int j=0;j<b;j++) cin>>B[j];
    for(int i=0;i<A.size() && i<B.size();i++)
    {
        if(A[i]>B[i])
        {
            aw++;
            A.push_back(A[i]);
        }
        if(A[i]<B[i])
        {
            bw++;
            B.push_back(B[i]);
        }
    }
    if(aw>bw) cout<<"alice"<<endl;
    if(aw<bw) cout<<"bob"<<endl;
    if(aw==bw) cout<<"draw"<<endl;
}
int main()
{
    int T;
    cin>>T;
    while(T--) solve();
    return 0;
}

尝试用vector来解决问题，而不用queue