제출 #1088514

#제출 시각아이디문제언어결과실행 시간메모리
10885144QT0RSure Bet (CEOI17_sure)C++17
100 / 100
63 ms3764 KiB
#include <bits/stdc++.h>
using namespace std;

vector<double> a;
vector<double> b;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	a.resize(n);
	b.resize(n);
	for (int i = 0; i<n; i++)cin >> a[i] >> b[i];
	sort(a.begin(),a.end(),greater<double>());
	sort(b.begin(),b.end(),greater<double>());
	int x=0,y=0;
	double ans=0,sma=0,smb=0;
	while(min(x,y)<n){
		if (x<n && (sma<smb || y==n))sma+=a[x++];
		else smb+=b[y++];
		ans=max(ans,min(sma,smb)-(x+y));
	}
	cout << fixed << setprecision(4) << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...