oj.uz

Submission #52666

# Submission time Handle Problem Language Result Execution time Memory
52666 2018-06-26T10:51:20 Z snat123 Sure Bet (CEOI17_sure) C++14
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int mxN=1e5;
int n;
double a[mxN+1], b[mxN+1], ans, sa, sb;
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i=0; i<n; ++i)
		cin >> a[i] >> b[i];
	sort(a, a+n+1);
	sort(b, b+n+1);
	for(int i1=n-1, i2=n-1; i1>=0&&i2>=0; ) {
		if(sa<sb)
			sa+=a[i1--];
		else
			sb+=b[i2--];
		ans=max(min(sa, sb)-(n-1-i1)-(n-1-i2), ans);
	}
	cout << fixed << setprecision(4) << ans;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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