답안 #52657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52657 2018-06-26T10:44:24 Z snat123 Sure Bet (CEOI17_sure) C++14
20 / 100
3 ms 544 KB
#include<bits/stdc++.h>
 
using namespace std;
 
int main(){
    int n;
    cin >> n;
    double a[n], b[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;
	double x=0.0, y=0.0, res=0.0;
	while(i>=0 || j>=0){
		if(x>=y || i<0){
			y+=b[j--];
			x-=1;
			y-=1;
			res=max(res, min(x, y));
			
		}
		else{
			x+=a[i--];
			y-=1.0;
			x-=1.0;
			res=max(res, min(x, y));
		}
	}
	printf("%.4lf", res);
    return 0;
} 
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 3 ms 536 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 2 ms 536 KB Output is correct
10 Correct 2 ms 536 KB Output is correct
11 Incorrect 2 ms 544 KB Output isn't correct
12 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 3 ms 536 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 2 ms 536 KB Output is correct
10 Correct 2 ms 536 KB Output is correct
11 Incorrect 2 ms 544 KB Output isn't correct
12 Halted 0 ms 0 KB -