#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==li && lj==j) return 0;
li=i;
lj=j;
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 << i << " " << j << endl;
}
cout << fixed << setprecision(4) << res;
//cin.close();
//cout.close();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
360 KB |
Output is correct |
| 4 |
Correct |
2 ms |
412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
488 KB |
Output is correct |
| 6 |
Correct |
2 ms |
488 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
360 KB |
Output is correct |
| 4 |
Correct |
2 ms |
412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
488 KB |
Output is correct |
| 6 |
Correct |
2 ms |
488 KB |
Output is correct |
| 7 |
Correct |
2 ms |
544 KB |
Output is correct |
| 8 |
Correct |
2 ms |
544 KB |
Output is correct |
| 9 |
Correct |
2 ms |
544 KB |
Output is correct |
| 10 |
Correct |
2 ms |
544 KB |
Output is correct |
| 11 |
Correct |
2 ms |
620 KB |
Output is correct |
| 12 |
Correct |
3 ms |
620 KB |
Output is correct |
| 13 |
Correct |
3 ms |
620 KB |
Output is correct |
| 14 |
Correct |
3 ms |
620 KB |
Output is correct |
| 15 |
Correct |
3 ms |
620 KB |
Output is correct |
| 16 |
Correct |
5 ms |
620 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
360 KB |
Output is correct |
| 3 |
Correct |
2 ms |
360 KB |
Output is correct |
| 4 |
Correct |
2 ms |
412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
488 KB |
Output is correct |
| 6 |
Correct |
2 ms |
488 KB |
Output is correct |
| 7 |
Correct |
2 ms |
544 KB |
Output is correct |
| 8 |
Correct |
2 ms |
544 KB |
Output is correct |
| 9 |
Correct |
2 ms |
544 KB |
Output is correct |
| 10 |
Correct |
2 ms |
544 KB |
Output is correct |
| 11 |
Correct |
2 ms |
620 KB |
Output is correct |
| 12 |
Correct |
3 ms |
620 KB |
Output is correct |
| 13 |
Correct |
3 ms |
620 KB |
Output is correct |
| 14 |
Correct |
3 ms |
620 KB |
Output is correct |
| 15 |
Correct |
3 ms |
620 KB |
Output is correct |
| 16 |
Correct |
5 ms |
620 KB |
Output is correct |
| 17 |
Correct |
149 ms |
2096 KB |
Output is correct |
| 18 |
Correct |
165 ms |
2172 KB |
Output is correct |
| 19 |
Correct |
161 ms |
2172 KB |
Output is correct |
| 20 |
Correct |
186 ms |
2172 KB |
Output is correct |
| 21 |
Correct |
189 ms |
2184 KB |
Output is correct |
| 22 |
Correct |
151 ms |
2184 KB |
Output is correct |
| 23 |
Correct |
149 ms |
2208 KB |
Output is correct |
| 24 |
Correct |
149 ms |
2208 KB |
Output is correct |
| 25 |
Correct |
151 ms |
2208 KB |
Output is correct |
| 26 |
Correct |
182 ms |
2208 KB |
Output is correct |
