普及-零分求调

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

int main()
{
    int a[7];
    map<int,int> bb;
    for (int i=0;i<7;i++)
    {
        int ac,b;
        cin >> ac >> b;
        a[i]=ac+b;
        if(bb[ac+b]==0)
        bb[ac+b]=i;
    }
    sort(a,a+7);
    if(a[6]<=8)
    {
        cout << 0 << endl;
    }
    else
    {
        cout << bb[a[6]]+1 << endl;
    }
}