博弈题汇总
C. Thanos Nim(2000)
难度⭐⭐⭐
传送门
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN 2000005
int t;
int n,k;
int boyi[MAXN];
int a[MAXN];
int main() {
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
int tot=0;
for(int i=1;i<=n;i++)
{
if(a[i]>a[1])tot++;
}
if(tot==n||tot<n/2)cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
}