0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-09-20 10:45:25 +00:00
OI-codes/Luogu/problem/P6408/P6408.cpp
2021-01-02 15:30:52 +08:00

21 lines
377 B
C++

#include<bits/stdc++.h>
using namespace std;
int main() {
int maxi, maxn, t0, t1;
for(int i = 0 ; i < 5 ; i++) {
t1 = 0;
for(int j = 0 ; j < 4 ; j++) {
cin >> t0;
t1 += t0;
}
if(t1 > maxn) {
maxn = t1;
maxi = i+1;
}
}
cout << maxi << ' ' << maxn << endl;
return 0;
}