C++每日一题（淘汰赛）

[想成为大佬的小何同学]

#include <iostream>
#include <queue>
#include <cmath>

using namespace std;

typedef pair<int, int> PII;

queue<PII> q;

int main()
{
	int n;
	cin >> n;
	
	for(int i = 1; i <= pow(2, n); i ++ )
	{
		int x;
		scanf("%d", &x);
		
		q.push({x, i});
	}
	
	while(q.size() > 2)
	{
		PII t1 = q.front();q.pop();
		PII t2 = q.front();q.pop();
		
		q.push(max(t1, t2));
	}
	
	PII res1 = q.front();
	q.pop();
	PII res2 = q.front();
	
	cout << min(res1, res2).second;
	
	return 0;
}

 

[是泡泡]

大佬大佬