80分蒟蒻求助,#4WA
查看原帖
80分蒟蒻求助,#4WA
222578
jingkongwanglimiaoa楼主2020/8/13 21:52

话不多说直接上代码

# include <cstdio>
# include <algorithm>
using namespace std;
# define MAXN 200
struct sth
{
    int user;
    int power;
}t[MAXN];
bool lll(sth a,sth b)
{
    return a.power > b.power;
}
int main()
{
    int sum;
    scanf("%d",&sum);
    sum = 1 << sum;
    for (int i = 1;i <= sum;i++)
    {
	t[i].user = i; 
        scanf("%d",&t[i].power);
    }
    sort(t + 1,t + sum/2,lll);
    sort(t + sum/2 + 1,t + sum,lll);
    if (t[1].power < t[sum/2 + 1].power)
    printf("%d",t[1].user);
    else printf("%d",t[sum/2 + 1]);
    return 0;
}

为什么啊为什么啊为什么啊

2020/8/13 21:52
加载中...