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

#include <cstdio>
#include <vector>
using namespace std;
const int N = 100001;
vector <int> school[N];//玩玩vector
int sum[N];
int main()
{
	int n,id,score;
	scanf("%d",&n);
	for(int i = 0;i < n; i++)
	{
		scanf("%d%d",&id,&score);
		school[id].push_back(score);
	}
	int t = N;
	while(t--){
		for(vector<int>::iterator it = school[t].begin() ;it != school[t].end();it++)
		{
			sum[t] += *it;
		}
	}
	int max = sum[0];
	int num;
	for(int i = 0;i < N; i++)
	{
		if(sum[i] > max){
			max = sum[i];
			num = i;
		}
	}
	printf("%d %d",num,max);
	return 0;
}

原文地址：https://www.cnblogs.com/qiangz/p/8447243.html