| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 52695 | 2018-06-26T11:26:28 Z | snat123 | Sure Bet (CEOI17_sure) | C++14 | 201 ms | 3844 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(j>=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 | 376 KB | Output is correct |
| 2 | Correct | 2 ms | 376 KB | Output is correct |
| 3 | Correct | 2 ms | 428 KB | Output is correct |
| 4 | Correct | 2 ms | 428 KB | Output is correct |
| 5 | Correct | 2 ms | 428 KB | Output is correct |
| 6 | Correct | 2 ms | 460 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 376 KB | Output is correct |
| 2 | Correct | 2 ms | 376 KB | Output is correct |
| 3 | Correct | 2 ms | 428 KB | Output is correct |
| 4 | Correct | 2 ms | 428 KB | Output is correct |
| 5 | Correct | 2 ms | 428 KB | Output is correct |
| 6 | Correct | 2 ms | 460 KB | Output is correct |
| 7 | Correct | 2 ms | 512 KB | Output is correct |
| 8 | Correct | 2 ms | 688 KB | Output is correct |
| 9 | Correct | 2 ms | 688 KB | Output is correct |
| 10 | Correct | 2 ms | 700 KB | Output is correct |
| 11 | Correct | 2 ms | 700 KB | Output is correct |
| 12 | Correct | 4 ms | 700 KB | Output is correct |
| 13 | Correct | 3 ms | 700 KB | Output is correct |
| 14 | Correct | 3 ms | 700 KB | Output is correct |
| 15 | Correct | 3 ms | 716 KB | Output is correct |
| 16 | Correct | 4 ms | 716 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 376 KB | Output is correct |
| 2 | Correct | 2 ms | 376 KB | Output is correct |
| 3 | Correct | 2 ms | 428 KB | Output is correct |
| 4 | Correct | 2 ms | 428 KB | Output is correct |
| 5 | Correct | 2 ms | 428 KB | Output is correct |
| 6 | Correct | 2 ms | 460 KB | Output is correct |
| 7 | Correct | 2 ms | 512 KB | Output is correct |
| 8 | Correct | 2 ms | 688 KB | Output is correct |
| 9 | Correct | 2 ms | 688 KB | Output is correct |
| 10 | Correct | 2 ms | 700 KB | Output is correct |
| 11 | Correct | 2 ms | 700 KB | Output is correct |
| 12 | Correct | 4 ms | 700 KB | Output is correct |
| 13 | Correct | 3 ms | 700 KB | Output is correct |
| 14 | Correct | 3 ms | 700 KB | Output is correct |
| 15 | Correct | 3 ms | 716 KB | Output is correct |
| 16 | Correct | 4 ms | 716 KB | Output is correct |
| 17 | Correct | 166 ms | 3692 KB | Output is correct |
| 18 | Correct | 169 ms | 3716 KB | Output is correct |
| 19 | Correct | 171 ms | 3780 KB | Output is correct |
| 20 | Correct | 168 ms | 3780 KB | Output is correct |
| 21 | Correct | 201 ms | 3780 KB | Output is correct |
| 22 | Correct | 168 ms | 3780 KB | Output is correct |
| 23 | Correct | 174 ms | 3844 KB | Output is correct |
| 24 | Correct | 168 ms | 3844 KB | Output is correct |
| 25 | Correct | 172 ms | 3844 KB | Output is correct |
| 26 | Correct | 199 ms | 3844 KB | Output is correct |