#include <bits/stdc++.h>
using namespace std;
long long n, k, m, ci, cmax, cu;
string namei, namemax;
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0;i<n;i++){
cin >> namei;
cin >> k >> m;
while (m >= k){
m = m - k + 2;
ci++;
}
if (ci > cmax){
cmax = ci;
namemax = namei;
}
cu = cu + ci;
ci = 0;
}
cout << cu << endl << namemax;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
516 KB |
Output is correct |
| 3 |
Correct |
2 ms |
540 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct |
| 6 |
Correct |
2 ms |
652 KB |
Output is correct |
| 7 |
Correct |
2 ms |
656 KB |
Output is correct |
| 8 |
Correct |
2 ms |
656 KB |
Output is correct |
| 9 |
Correct |
2 ms |
656 KB |
Output is correct |
| 10 |
Correct |
2 ms |
656 KB |
Output is correct |
| 11 |
Correct |
2 ms |
656 KB |
Output is correct |
| 12 |
Correct |
2 ms |
656 KB |
Output is correct |
| 13 |
Correct |
2 ms |
656 KB |
Output is correct |
| 14 |
Correct |
2 ms |
668 KB |
Output is correct |
| 15 |
Correct |
2 ms |
668 KB |
Output is correct |
| 16 |
Correct |
2 ms |
668 KB |
Output is correct |
| 17 |
Correct |
2 ms |
672 KB |
Output is correct |
| 18 |
Correct |
2 ms |
676 KB |
Output is correct |
| 19 |
Correct |
2 ms |
684 KB |
Output is correct |
| 20 |
Correct |
2 ms |
684 KB |
Output is correct |
| 21 |
Correct |
2 ms |
688 KB |
Output is correct |
| 22 |
Correct |
2 ms |
692 KB |
Output is correct |
| 23 |
Correct |
2 ms |
696 KB |
Output is correct |
| 24 |
Correct |
2 ms |
704 KB |
Output is correct |
| 25 |
Correct |
3 ms |
708 KB |
Output is correct |
