제출 #1110616

#제출 시각아이디문제언어결과실행 시간메모리
1110616vjudge1Tuna (COCI17_tuna)C++17
50 / 50
1 ms508 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...