203632026-01-06 17:05:32algoproTV szolgáltatókcpp17Wrong answer 12/40116ms2520 KiB
// UUID: 26f65125-fba1-41f0-a878-d20e6afdc02d
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<array<int, 2>> v(n);
	vector<int> d;
	for (int i = 0; i < n; i++) {
		cin >> v[i][0] >> v[i][1];
		d.push_back(v[i][1] - k + 1);
		d.push_back(v[i][0]);
	}

	sort(d.begin(), d.end());
	int x = d[n], sum = 0;
	for (int i = 0; i < n; i++) {
		if (x < v[i][0]) sum += v[i][0] - x;
		if (x + k - 1 > v[i][1]) sum += (x + k - 1) - v[i][1];
	}

	cout << sum;
}
SubtaskSumTestVerdictTimeMemory
base12/40
1Accepted0/01ms508 KiB
2Accepted0/01ms508 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/12ms316 KiB
6Accepted1/12ms500 KiB
7Accepted2/22ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/22ms516 KiB
10Accepted2/22ms316 KiB
11Wrong answer0/246ms1368 KiB
12Wrong answer0/246ms1384 KiB
13Wrong answer0/246ms1400 KiB
14Wrong answer0/246ms1416 KiB
15Wrong answer0/296ms2220 KiB
16Wrong answer0/294ms2220 KiB
17Wrong answer0/257ms1200 KiB
18Wrong answer0/257ms1400 KiB
19Wrong answer0/257ms1316 KiB
20Wrong answer0/257ms1452 KiB
21Wrong answer0/157ms1200 KiB
22Wrong answer0/157ms1200 KiB
23Wrong answer0/1115ms2200 KiB
24Wrong answer0/1115ms2220 KiB
25Wrong answer0/1115ms2248 KiB
26Wrong answer0/1115ms2280 KiB
27Wrong answer0/1115ms2212 KiB
28Wrong answer0/1116ms2520 KiB