# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
161802 | 2019-11-04T12:44:36 Z | dantoh000 | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main(){ int n; scanf("%lld",&n); int a[n], b[n]; for (int i = 0; i < n; i++){ double x,y; scanf("%lf%lf",&x,&y); x = (10000)*x + 0.1; y = (10000)*y + 0.1; a[i] = x, b[i] = y; } sort(a,a+n,greater<int>()); sort(b,b+n,greater<int>()); int ida = 0, idb = 0; ll suma = 0, sumb = 0; ll ans = 0; for (int i = 1; i <= 2*n; i++){ if (ida != n && suma < sumb){ suma += a[ida]; ida++; } else{ sumb += b[idb]; idb++; } ans = max(ans,max(0ll,min(suma,sumb)-10000ll*i)); } double actans = ((double)ans)/10000; printf("%.4f",actans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Incorrect | 2 ms | 376 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Incorrect | 2 ms | 376 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Incorrect | 2 ms | 376 KB | Output isn't correct |