203522026-01-06 16:45:42algoproTV szolgáltatókcpp17Wrong answer 29/40115ms3680 KiB
// UUID: def9bd9d-e016-4e65-8558-c76f5b6702f0
#include <bits/stdc++.h>
using namespace std;

#define int int64_t

int32_t main() {
	int n , k; cin >> n >> k;
	vector<int> a;
	vector<array<int , 2>> b;
	for(int i = 0; i < n; i++){
		int l , r; cin >> l >> r;
		int R = r-k;
		R = max(R , l);
		a.push_back(l);
		a.push_back(R);
		b.push_back({l , r});
	}
	sort(a.begin() , a.end());
	int u = a[a.size()/2];
	int ans = 0;
	for(int i = 0; i < n; i++){
		ans += max(int(0) , u+k-1-b[i][1]);
		ans += max(int(0) , b[i][0]-u);
	}
	cout << ans << endl;
}
SubtaskSumTestVerdictTimeMemory
base29/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted1/11ms500 KiB
4Accepted1/11ms316 KiB
5Accepted1/12ms316 KiB
6Wrong answer0/12ms424 KiB
7Accepted2/22ms456 KiB
8Wrong answer0/22ms316 KiB
9Accepted2/22ms316 KiB
10Accepted2/22ms500 KiB
11Accepted2/248ms1888 KiB
12Accepted2/246ms1988 KiB
13Wrong answer0/246ms1992 KiB
14Wrong answer0/248ms2056 KiB
15Wrong answer0/296ms3640 KiB
16Wrong answer0/294ms3548 KiB
17Accepted2/257ms1880 KiB
18Accepted2/257ms1972 KiB
19Accepted2/257ms2016 KiB
20Accepted2/257ms1880 KiB
21Accepted1/156ms1876 KiB
22Accepted1/157ms2112 KiB
23Accepted1/1115ms3648 KiB
24Accepted1/1115ms3648 KiB
25Accepted1/1114ms3572 KiB
26Accepted1/1115ms3632 KiB
27Accepted1/1115ms3680 KiB
28Accepted1/1115ms3656 KiB