oj.uz

답안 #1027293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027293 2024-07-19T03:23:46 Z BuzzyBeez Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

const int buff = 1e4;

long long A[100008], B[100008];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n; double x; cin >> n;
	for (int i = 1; i <= n; ++i) cin >> x, A[i] = round(x * buff);
	for (int i = 1; i <= n; ++i) cin >> x, B[i] = round(x * buff);
	sort(A + 1, A + n + 1, greater<long long>()); sort(B + 1, B + n + 1, greater<long long>());
	partial_sum(A, A + n + 1, A); partial_sum(B, B + n + 1, B);
	int j; long double ans = 0;
	for (int i = 1; i <= n && A[i] <= B[n]; ++i) { // A[i] < B[j]
		j = lower_bound(B + 1, B + n + 1, A[i]) - B;
		ans = max(ans, (long double) (A[i] * 1.0) / buff - i - j);
	}
	for (int i = 1; i <= n && B[i] <= A[n]; ++i) { // B[i] < A[j]
		j = lower_bound(A + 1, A + n + 1, B[i]) - A;
		ans = max(ans, (long double) (B[i] * 1.0) / buff - i - j);
	}
	cout << fixed << setprecision(8) << ans;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -