제출 #113604

#제출 시각아이디문제언어결과실행 시간메모리
113604VardanyanSure Bet (CEOI17_sure)C++14
20 / 100
3 ms384 KiB
#include <bits/stdc++.h> using namespace std; const int N = 100*1000+5; pair<double,double> a[N]; double prefa[N],prefb[N]; int main() { ios_base::sync_with_stdio(false); int n; cin>>n; for(int i = 1;i<=n;i++) cin>>a[i].first>>a[i].second; sort(a+1,a+1+n); reverse(a+1,a+1+n); for(int i = 1;i<=n;i++) prefa[i] = prefa[i-1]+a[i].first; for(int i = 1;i<=n;i++) swap(a[i].first,a[i].second); sort(a+1,a+1+n); reverse(a+1,a+1+n); for(int i = 1;i<=n;i++) prefb[i] = prefb[i-1]+a[i].first; double ans = 0; for(int i = 0;i<=n;i++){ for(int j = max(0,i-100);j<=min(n,i+100);j++){ ans = max(ans,min(prefa[i],prefb[j])-(i+j)); } } printf("%.4lf",(double)ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...