# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
153409 | 2019-09-14T06:12:15 Z | junodeveloper | Sure Bet (CEOI17_sure) | C++14 | 92 ms | 3704 KB |
#include <bits/stdc++.h> #define sz(x) ((int)x.size()) #define all(x) (x).begin(), (x).end() #define fi first #define se second using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; int n; double a[100010],b[100010]; int main() { scanf("%d",&n); int i; for(i=1;i<=n;i++)scanf("%lf%lf",a+i,b+i); sort(a+1,a+n+1); sort(b+1,b+n+1); for(i=1;i<=n;i++) a[i+1]+=a[i],b[i+1]+=b[i]; int k; double ans=0; for(k=1;k<=n+n;k++) { int lo=max(0,k-n),hi=min(n,k); while(lo<hi) { int mid=(lo+hi+1)/2; if(a[n]-a[n-mid]<b[n]-b[n-(k-mid)]) lo=mid; else hi=mid-1; } if(a[n]-a[n-lo]<b[n]-b[n-(k-lo)]) ans=max(ans,a[n]-a[n-lo]-k); else ans=max(ans,b[n]-b[n-(k-lo)]-k); if(lo<min(n,k)) ans=max(ans,b[n]-b[n-(k-lo-1)]-k); } printf("%.4f",ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 3 ms | 376 KB | Output is correct |
13 | Correct | 3 ms | 380 KB | Output is correct |
14 | Correct | 3 ms | 376 KB | Output is correct |
15 | Correct | 3 ms | 380 KB | Output is correct |
16 | Correct | 3 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 3 ms | 376 KB | Output is correct |
13 | Correct | 3 ms | 380 KB | Output is correct |
14 | Correct | 3 ms | 376 KB | Output is correct |
15 | Correct | 3 ms | 380 KB | Output is correct |
16 | Correct | 3 ms | 376 KB | Output is correct |
17 | Correct | 86 ms | 1916 KB | Output is correct |
18 | Correct | 86 ms | 1828 KB | Output is correct |
19 | Correct | 90 ms | 1912 KB | Output is correct |
20 | Correct | 90 ms | 3376 KB | Output is correct |
21 | Correct | 90 ms | 3620 KB | Output is correct |
22 | Correct | 86 ms | 3192 KB | Output is correct |
23 | Correct | 88 ms | 3320 KB | Output is correct |
24 | Correct | 92 ms | 3320 KB | Output is correct |
25 | Correct | 89 ms | 3328 KB | Output is correct |
26 | Correct | 90 ms | 3704 KB | Output is correct |