PAT乙级1032：挖掘机技术哪家强

#include <iostream>
#include <algorithm>

using namespace std;

int main() 
{
	int N = 0;
	cin >> N;
	int k = N;
	int sum[100005] = { 0 }; //存储各个组的总数
	int a = 0, b = 0;
	while(N--)
	{
		scanf("%d%d", &a, &b);
		sum[a] += b;
	}
	
	int maxteam = 1, maxvalue = sum[1];
	for (int i = 2; i <= k; i++)
	{
		if (sum[i]>maxvalue)
		{
			maxvalue = sum[i];
			maxteam = i;
		}
	}

	printf("%d %d", maxteam, maxvalue);

	return 0;
}