Educational Codeforces Round 129 (Rated for Div. 2) A. Game with Cards

 

 题解：最大值哪边就哪边赢，如果一样就先出的赢，没什么好说的。

#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define endl '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int>PII;

const int N=200010;

int t,n,m;
int a[N],b[N];

void solve()
{
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	cin>>m;
	for(int i=0;i<m;i++)cin>>b[i]; 
	sort(a,a+n);
	sort(b,b+m);
	int sub=a[n-1]-b[m-1];
	if(sub>0)cout<<"Alice"<<endl<<"Alice"<<endl;
	if(sub<0)cout<<"Bob"<<endl<<"Bob"<<endl;
	if(sub==0)cout<<"Alice"<<endl<<"Bob"<<endl; 
	
}

int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
 }