1. 程式人生 > >1032 挖掘機技術哪家強

1032 挖掘機技術哪家強

max href bsp title 鏈接 score cor sco turn

題目鏈接:https://pintia.cn/problem-sets/994805260223102976/problems/994805289432236032

題解:

 1 #include <iostream>
 2 #include<string>
 3 using namespace std;
 4 
 5 const int MAXN = 100000 + 5;
 6 
 7 struct School {
 8     int num;
 9     int score;
10 };
11 void Initate(School s[]) {
12     for (int i = 0; i < MAXN; i++) {
13 s[i].num = 0; 14 s[i].score = 0; 15 } 16 } 17 int main() { 18 int n, a, b; 19 cin >> n; 20 School s[MAXN]; 21 Initate(s); 22 while (n--) { 23 cin >> a >> b; 24 s[a].score += b; 25 } 26 int max = s[0].score, t = 0; 27 for
(int i = 0; i < MAXN; i++) { 28 if (s[i].score > max) { 29 max = s[i].score; 30 t = i; 31 } 32 } 33 cout << t << " " << max << endl; 34 return 0; 35 }

1032 挖掘機技術哪家強