本来我想看看求列表第二大数索引能骗多少分，没想到直接AC了…………

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n, p = 2;
    cin >> n;

    for (int i = 1; i <= n - 1; i++)
    {
        p *= 2;
    }

    int a[p + 1], b[p + 1];

    for (int i = 1; i <= p; i++)
    {
        cin >> a[i];
        b[i] = a[i];
    }

    sort(a + 1, a + p + 1);

    for (int i = 1; i <= p; i++)
    {
        if (a[p - 1] == b[i])
        {
            cout << i;
            break; 
        }
    }

    return 0;
}

请求添加hack数据