挖掘机技术哪家强

题源

PTA 乙级

题解

#include <stdio.h>
long long n;
int book[100001] = {0};
int main(void) {
    int i;
    int id=0,max=0;
    
    scanf("%ld",&n);
    for ( i = 0; i < n; i++)
    {
        scanf("%d %d",&id,&max);
        book[id] += max;
    }
    for ( i = 0; i < n; i++)
    {
        if ( book[i] > max)
        {
            max = book[i];
            id = i;
        }
    }
    printf("%d %d\n",id,book[id]);
//     getchar();getchar();
    return 0;
}