제출 #52657

#제출 시각아이디문제언어결과실행 시간메모리
52657snat123Sure Bet (CEOI17_sure)C++14
20 / 100
3 ms544 KiB
#include<bits/stdc++.h>
 
using namespace std;
 
int main(){
    int n;
    cin >> n;
    double a[n], b[n];
    for(int i=0; i<n; i++) cin >> a[i] >> b[i];
    sort(a, a+n);
	sort(b, b+n);
	int i=n-1, j=n-1;
	double x=0.0, y=0.0, res=0.0;
	while(i>=0 || j>=0){
		if(x>=y || i<0){
			y+=b[j--];
			x-=1;
			y-=1;
			res=max(res, min(x, y));
			
		}
		else{
			x+=a[i--];
			y-=1.0;
			x-=1.0;
			res=max(res, min(x, y));
		}
	}
	printf("%.4lf", res);
    return 0;
} 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...