제출 #570835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570835		duytuandao21	Sure Bet (CEOI17_sure)	C++17	0 / 100	11 ms	384 KiB

sure

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N = 2e6+7;
int n;
long double a[N], b[N], prefixSumA[N], prefixSumB[N], res = 0;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
	sort(a+1,a+1+n,greater<long double>());
	sort(b+1,b+1+n,greater<long double>());
	for(int i=1;i<=n;i++) {
		prefixSumA[i] = prefixSumA[i-1] + a[i];
		prefixSumB[i] = prefixSumB[i-1] + b[i];

	}
	/* for(int i=1;i<=2*n;i++) {
		int l = 0;
		int r = i;
		while(l <= r) {
			int mid = (l+r)/2;
			long double va1 = prefixSumA[mid], va11 = prefixSumB[mid];
			long double va2 = prefixSumB[i-mid], va22 = prefixSumA[i-mid];
			res = max(res, min(va1 - i, va2 - i));
			res = max(res, min(va11 - i, va22 - i));
			if(va1 - i > va2 - i) l = mid + 1; else r = mid - 1;
		}
	} */
	int j = 1;
	for(int i=1;i<=n;i++) {
		res = max(res, min(prefixSumA[i], prefixSumB[j]) - (i + j));

		while(prefixSumB[j] - (i + j) < prefixSumA[i] - (i+j)) j++;

		res = max(res, min(prefixSumA[i], prefixSumB[j]) - (i + j));
	}
	printf("%.4lf",(double)res);
	return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40