| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1225788 | theiulius | Sure Bet (CEOI17_sure) | C++20 | 50 ms | 2632 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
// #define endl "\n"
int n;
main(){
/*ifstream cin(".in");
ofstream cout(".out");*/
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
double a[n] = {}, b[n] = {};
for (int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
sort(a, a + n, greater<double>());
sort(b, b + n, greater<double>());
double pre[n] = {b[0]};
int nd = n;
for (int i = 1; i < n; i++){
if (b[i] < 1 && nd == n){
nd = i;
}
pre[i] = pre[i - 1] + b[i];
}
double left = 0, res = (double)0;
for (int i = 0; i < n; i++){
left += a[i];
if (a[i] < 1){
break;
}
int l = 0, r = nd - 1, ans = nd - 1;
while (l <= r){
int mid = (l + r) / 2;
double right = pre[mid];
if (right >= left){
ans = mid;
r = mid - 1;
}else{
l = mid + 1;
}
}
res = max(res, (double)min(pre[ans] - (double)ans - (double)i - 2.0, (double)left - (double)ans - (double)i - 2.0));
// cout << (double)left - (double)ans - (double)i - 2.0 << endl;
if (ans){
ans -= 1.0;
res = max(res, (double)min(pre[ans] - (double)ans - (double)i - 2.0, (double)left - (double)ans - (double)i - 2.0));
}
}
printf("%.4lf",(double)res);
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
