oj.uz

Submission #52681

# Submission time Handle Problem Language Result Execution time Memory
52681 2018-06-26T11:02:52 Z snat123 Sure Bet (CEOI17_sure) C++14
0 / 100
 2000 ms 472 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
double a[100001], b[100001];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    int n;
    cin >> 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(j>=0 && x>y) y+=b[j--];
		else if(i>=0) x+=a[i--];
		res=max(res, min(x, y)-(n-i)-(n-j)+2);
	}
	cout << fixed << setprecision(4) << res;
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 372 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Execution timed out 2048 ms 472 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 372 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Execution timed out 2048 ms 472 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 372 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Execution timed out 2048 ms 472 KB Time limit exceeded
5 Halted 0 ms 0 KB -