PTA 乙1032 挖掘机技术哪家强（c++）

//

#include <iostream>

#include<math.h>
#include <iomanip>
#include<algorithm>
#define MAX_SIZE 100000
using namespace std;
struct SCHOOL{
    int number;
    int score;
    
};


bool cmp(SCHOOL A,SCHOOL B)
{
    return A.number < B.number;
}

bool cmp2(SCHOOL A,SCHOOL B)
{
    return A.score < B.score;
}



int main(int argc, const char * argv[]) {
    
    int n;
    cin>>n;
    int sch;
    int sco;
    
    SCHOOL school[n];
    for(int i=0;i<n;i++)  //----优化1
    {
        cin>>sch;
        school[i].number=sch;
        cin>>sco;
        school[i].score=sco;
        
    }
    
    
    sort(school,school+n,cmp);
    
    //cout<<"========\n";
    for(int i=0;i<n;i++)
    {
        int j=1;
        while(school[i+j].number==school[i].number)
        {
            
            school[i].score=school[i].score+school[i+j].score;
            j++;
        }
        //i=i+count1;
        //cout<<school[i].number<<" "<<school[i].score<<endl;
    }
    
    sort(school,school+n,cmp2);
    //cout<<"\n========\n";
    cout<<school[n-1].number<<" "<<school[n-1].score;
    
    
    
    return 0;
    
    
    
}
//123 4577973