24892023-01-13 19:11:13kohumarkTV szolgáltatókcpp11Wrong answer 12/40972ms6176 KiB
#include <iostream>
#include <climits>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n, k; cin >> n >> k;
	int bj[n][2];
	int veg=0;
	for(int i=0; i<n; i++){
		cin >> bj[i][0] >> bj[i][1];
		veg=max(veg,bj[i][1]);
		bj[i][0]--; bj[i][1]--;
	}
	int petak=0; int minim=INT_MAX;
	
	int j=veg/2; int num=1; int pl=-1; int rossz=0;
	while((j>k-2&&j<veg)&&(rossz<2)){
		petak=0;
		for(int i=0; i<n; i++){
			if(j-k+1<bj[i][0]) petak+=bj[i][0]-(j-k+1);
			if(j>bj[i][1]) petak+=j-bj[i][1];
		}
		if(minim==min(minim,petak))rossz++;
		else rossz=0;
		minim=min(minim,petak);
		pl*=-1; num+=1; j=j+(pl*num);
	}
	
	cout << minim;
}
SubtaskSumTestVerdictTimeMemory
base12/40
1Accepted0/03ms1892 KiB
2Accepted0/02ms1984 KiB
3Accepted1/12ms2184 KiB
4Accepted1/12ms2408 KiB
5Accepted1/13ms2472 KiB
6Accepted1/17ms2604 KiB
7Accepted2/23ms2820 KiB
8Accepted2/23ms3004 KiB
9Accepted2/250ms3084 KiB
10Accepted2/279ms3356 KiB
11Wrong answer0/2178ms3936 KiB
12Wrong answer0/2504ms4060 KiB
13Wrong answer0/2333ms4136 KiB
14Time limit exceeded0/2954ms3260 KiB
15Time limit exceeded0/2970ms3580 KiB
16Time limit exceeded0/2958ms3612 KiB
17Time limit exceeded0/2953ms3380 KiB
18Time limit exceeded0/2962ms3552 KiB
19Time limit exceeded0/2949ms3748 KiB
20Time limit exceeded0/2968ms3624 KiB
21Time limit exceeded0/1949ms3752 KiB
22Time limit exceeded0/1966ms3912 KiB
23Time limit exceeded0/1972ms4480 KiB
24Time limit exceeded0/1964ms4452 KiB
25Wrong answer0/1712ms6176 KiB
26Time limit exceeded0/1963ms4492 KiB
27Time limit exceeded0/1970ms4556 KiB
28Time limit exceeded0/1966ms4740 KiB