# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
52696 | 2018-06-26T11:27:00 Z | snat123 | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 588 KB |
#include<bits/stdc++.h> using namespace std; long 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; long 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 << fixed << setprecision(4) << res; //cin.close(); //cout.close(); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 484 KB | Output is correct |
3 | Correct | 2 ms | 564 KB | Output is correct |
4 | Correct | 2 ms | 564 KB | Output is correct |
5 | Correct | 2 ms | 564 KB | Output is correct |
6 | Incorrect | 2 ms | 588 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 484 KB | Output is correct |
3 | Correct | 2 ms | 564 KB | Output is correct |
4 | Correct | 2 ms | 564 KB | Output is correct |
5 | Correct | 2 ms | 564 KB | Output is correct |
6 | Incorrect | 2 ms | 588 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 484 KB | Output is correct |
3 | Correct | 2 ms | 564 KB | Output is correct |
4 | Correct | 2 ms | 564 KB | Output is correct |
5 | Correct | 2 ms | 564 KB | Output is correct |
6 | Incorrect | 2 ms | 588 KB | Output isn't correct |