1032 挖掘机技术哪家强

解题代码

#include<cstdio>
const int maxn = 100001;
int a[maxn];
int main()
{
	int num, school, score;
	scanf("%d", &num);
	for (int i = 0; i < num;i++) {
		scanf("%d%d", &school, &score);
		a[school] += score;
	}
	int max = -1, index=1;
	for (int i = 1; i <= num; i++) {
		if (a[i] > max) {
			max = a[i];
			index = i;
		}
	}
	printf("%d %d\n", index , max);
	return 0;
}

测试结果

问题整理

1.简单模拟。