#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int N; cin >> N;
int X; cin >> X;
int cost = 0;
for (int i = 0; i < N; i++) {
int P1, P2; cin >> P1 >> P2;
if (abs(P1 - P2) > X) {
int P3; cin >> P3;
cost += P3;
} else {
cost += max(P1, P2);
}
}
cout << cost << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
300 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
300 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |