# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
904000 | 2024-01-11T16:41:52 Z | Dec0Dedd | Sure Bet (CEOI17_sure) | C++14 | 0 ms | 360 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef long double ld; const int N = 100; const int K = 1e4; ld a[N], b[N]; ll n; void solve() { cin>>n; for (int i=1; i<=n; ++i) { cin>>a[i]>>b[i]; } sort(a+1, a+n+1, greater<ld>()), sort(b+1, b+n+1, greater<ld>()); ld ans=0, sa=0; for (int i=0; i<=n; ++i) { ld sb=0; sa+=a[i]; for (int j=0; j<=n; ++j) { sb+=b[j]; ans=max(ans, min(sa, sb)-i*K-j*K); } } //cout<<ans<<"\n"; printf("%.4lf", ans); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t=1; while (t--) solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |