PAT乙级1032 挖掘机技术哪家强 (20 分)

Posted 2021-08-04 辉小歌

题目地址

#include<cstdio>
int school[100005];
int main(void)
{
    int n,sch,number;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d %d",&sch,&number);
        school[sch]+=number;
    }
    int max_x,max;
    max=-1;
    for(int i=1;i<=n;i++)
    {
        if(school[i]>max)
        {
            max_x=i;
            max=school[i];
        }
    }
    printf("%d %d",max_x,max);
    return 0;
}