# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
65770 | 2018-08-08T17:51:11 Z | naderjemel | Sure Bet (CEOI17_sure) | C++14 | 2000 ms | 520 KB |
#include <bits/stdc++.h> using namespace std; const long long INF=2e9; int main(){ int n; scanf("%d",&n); vector<long long> as,bs; for(int i=0;i<n;i++){ double a,b; scanf("%lf %lf",&a,&b); a*=10000; b*=10000; long long A=a; long long B=b; as.push_back(A); bs.push_back(B); } sort(as.begin(),as.end()); sort(bs.begin(),bs.end()); reverse(as.begin(),as.end()); reverse(bs.begin(),bs.end()); int i=0,j=0; long long rs=0,us=0; long long nowa=0,nowb=0; while(i<n || j<n){ if(nowa<=nowb && i<n){ nowa+=as[i]; i++; us+=10000; } else if(j<n){ nowb+=bs[j]; j++; us+=10000; } rs=max(rs,min(nowa-us,nowb-us)); } printf("%.4lf\n", (double)rs/10000.0); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 356 KB | Output is correct |
3 | Execution timed out | 2053 ms | 520 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 356 KB | Output is correct |
3 | Execution timed out | 2053 ms | 520 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 356 KB | Output is correct |
3 | Execution timed out | 2053 ms | 520 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |