제출 #1027645

#제출 시각아이디문제언어결과실행 시간메모리
1027645vjudge1Sure Bet (CEOI17_sure)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define f first #define s second void solve(){ int n; cin >> n; vector<double> a(n), b(n); double ans = 0; for(int i = 0; i < n; i++){ cin >> a[i] >> b[i]; } sort(a.rbegin(), a.rend()); double x = 0, y = 0; int i = 0, j = 0, tu = 0; while(i < n && j < n){ if(x <= y){ x+=a[i]; tu++; i++; } else{ y+=b[j]; tu++; j++; } ans=max(ans, min(x, y)-tu); } cout << fixed << setprecision(4) << ans << endl; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; // cin >> t; while(t--){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...