During their New Year holidays, Alice and Bob play the following game using an array a of n integers:
Players take turns, Alice moves first.
Each turn a player chooses any element and removes it from the array.
If Alice chooses even value, then she adds it to her score. If the chosen value is odd, Alice’s score does not change.
Similarly, if Bob chooses odd value, then he adds it to his score. If the chosen value is even, then Bob’s score does not change.
If there are no numbers left in the array, then the game ends. The player with the highest score wins. If the scores of the players are equal, then a draw is declared.
For example, if n=4 and a=[5,2,7,3], then the game could go as follows (there are other options):
On the first move, Alice chooses 2 and get two points. Her score is now 2. The array a is now [5,7,3].
On the second move, Bob chooses 5 and get five points. His score is now 5. The array a is now [7,3].
On the third move, Alice chooses 7 and get no points. Her score is now 2. The array a is now [3].
On the last move, Bob chooses 3 and get three points. His score is now 8. The array a is empty now.
Since Bob has more points at the end of the game, he is the winner.
You want to find out who will win if both players play optimally. Note that there may be duplicate numbers in the array.
Input
The first line contains an integer t (1≤t≤104) — the number of test cases. Then t test cases follow.
The first line of each test case contains an integer n (1≤n≤2⋅105) — the number of elements in the array a.
The next line contains n integers a1,a2,…,an (1≤ai≤109) — the array a used to play the game.
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.
Output
For each test case, output on a separate line:
“Alice” if Alice wins with the optimal play;
“Bob” if Bob wins with the optimal play;
“Tie”, if a tie is declared during the optimal play.
Example
inputCopy
4
4
5 2 7 3
3
3 2 1
4
2 2 2 2
2
7 8
outputCopy
Bob
Tie
Alice
Alice
对金额进行排序，因为每个数只能取一次，即使自己拿不到也可以阻止别人拿到，变相等于自己的分数，所以每次拿最大的就好了
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define ls (k<<1)
#define rs (k<<1|1)
#define pb push_back
#define mid ((l+r)>>1)
#include<bits/stdc++.h>
using namespace std;
const int p=1e4+7;
const int mod=1e9+7;
const int maxn=1e6+1;
typedef long long ll;
const int inf=0x3f3f3f3f;
ll a[maxn],b[maxn];
bool cmp(ll x,ll y)
{
return x>y;
}
void solve(){
int t;
cin>>t;
while(t--)
{
int n;cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n,cmp);
ll A1=0;
ll B1=0;
for(int i=1;i<=n;i++)
{
if(i%2==1){
if(a[i]%2==0){
A1+=a[i];
}
}
else if(i%2==0){
if(a[i]%2==1){
B1+=a[i];
}
}
}
if(A1>B1){
cout<<"Alice"<<endl;
}
else if(A1==B1){
cout<<"Tie"<<endl;
}
else{
cout<<"Bob"<<endl;
}
}
}
signed main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
solve();
return 0;
}