PAT乙题 1032. 挖掘机技术哪家强(20)

2018/01/26 PAT 共 499 字,约 2 分钟
#include <iostream>
#include <algorithm>
#include<math.h>
#include<string>
#include<vector>
#include<ctype.h>
#include<set>
using namespace std;
int main() {
#ifdef LOCAL
	freopen("D:\\datain.txt", "r", stdin);
#endif
	int n;
	cin >> n;
	int d[100005];
	fill(d, d + 100005, 0);
	int a;
		int b;
	for (int i = 0; i < n; i++) {
		scanf("%d %d", &a, &b);
		d[a] += b;
	}
	int maxd = 0.0;
	int maxi = 0;
	for (int i = 0; i < 100005; i++) {
		if (d[i] > maxd) {
			maxd = d[i];
			maxi = i;
		}
	}
	printf("%d %d", maxi, maxd);
}

Search

    Table of Contents