oj.uz

Submission #447456

# Submission time Handle Problem Language Result Execution time Memory
447456 2021-07-26T11:23:21 Z fuad27 Sure Bet (CEOI17_sure) C++14
0 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;
int main () {
	long long n,Ai=0,Bi=0;cin>>n;
	long double ans=0.0,sA=0.0,sB=0.0,a[n+1],b[n+1];
	for(int i=0;i<n;i++)cin>>a[i]>>b[i];
	sort(a,a+n);sort(b,b+n);
	reverse(a,a+n);reverse(b,b+n);
	while(Ai<=n && Bi<=n) {
		if(sB<sA)sB+=b[Bi],Bi++;
		else sA+=a[Ai],Ai++;
		ans = max(ans,min(sA-Ai-Bi,sB-Ai-Bi));
	}
	cout.precision(4);
	cout<<fixed<<ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -