oj.uz

답안 #52670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52670 2018-06-26T10:56:00 Z snat123 Sure Bet (CEOI17_sure) C++14
20 / 100
 2 ms 564 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
double a[100001], b[100001];

int main(){
    int n;
    cin >> n;
    for(int i=0; i<n; i++) cin >> a[i] >> b[i];
    sort(a, a+n+1);
	sort(b, b+n+1);
	int i=n, j=n;
	double x=0.0, y=0.0, res=0.0;
	while(i>=0 || j>=0){
		if(x>y || i<0) y+=b[j--];
		else x+=a[i--];
		//x-=1;
		//y-=1;
		res=max(res, min(x, y)-(n-i)-(n-j));
	}
	printf("%.4lf", res);
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 Correct 2 ms 564 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Incorrect 2 ms 564 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Incorrect 2 ms 564 KB Output isn't correct
12 Halted 0 ms 0 KB -