#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
typedef vector<int> vi;
typedef vector<char> vc;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 2e5 + 100;
int n,x;
vi h,z;
int32_t main(){
cin >> n >> x;
h.resize(n); z.resize(n);
int sm = 0;
for (int i = 0; i < n; i++){
cin >> h[i] >> z[i];
if (abs(h[i] - z[i]) > x){
int tmp; cin >> tmp; sm += tmp;
}
else sm += max(h[i],z[i]);
}
cout << sm << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
508 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |