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

很简单就不解释了~

#include <stdio.h>
int main()
{
	int N, players[100010] = {0};
    
	scanf("%d", &N);
	for(int i = 0; i < N; i++)
	{
		int j, score;
		scanf("%d%d", &j, &score);
		players[j] += score;
	}
	int index = 0, max = -1;
	for(int i = 1; i <= N; i++)
	{
		if(players[i] && players[i] >= max)
			{
				max = players[i];
				index = i;
			 } 
	}
	printf("%d %d", index, players[index]);
	return 0;
 }