oj.uz

Submission #52691

# Submission time Handle Problem Language Result Execution time Memory
52691 2018-06-26T11:20:34 Z snat123 Sure Bet (CEOI17_sure) C++14
20 / 100
 2 ms 736 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
double a[100001], b[100001];
 
int main(){
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);
	//ifstream cin;
	//ofstream cout;
	//cin.open("input.txt");
	//cout.open("output.txt");
    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, li=-1, lj=-1;
	double x=0.0, y=0.0, res=0.0;
	while(i>=0 || j>=0){
		if(i<0 || x>y) y+=b[j--];
		else if(i>=0 )x+=a[i--];
		else break;
		res=max(res, min(x, y)-(n-i)-(n-j)+2);
		//cout << i << " " << j << endl;
	}
	cout << fixed << setprecision(4) << res;
	//cin.close();
	//cout.close();
    return 0;
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:19:20: warning: unused variable 'li' [-Wunused-variable]
  int i=n-1, j=n-1, li=-1, lj=-1;
                    ^~
sure.cpp:19:27: warning: unused variable 'lj' [-Wunused-variable]
  int i=n-1, j=n-1, li=-1, lj=-1;
                           ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 676 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Incorrect 2 ms 736 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Incorrect 2 ms 736 KB Output isn't correct
12 Halted 0 ms 0 KB -