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

2018-02-13 19:55:54来源:cnblogs.com作者:zengq人点击

分享
#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;} 

  

最新文章

123

最新摄影

闪念基因

微信扫一扫

第七城市微信公众平台