제출 #595855

#제출 시각아이디문제언어결과실행 시간메모리
595855OttoTheDinoSure Bet (CEOI17_sure)C++17
60 / 100
2055 ms3132 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,s,e) for (int i = s; i <= e; ++i) #define rrep(i,s,e) for (int i = s; i >= e; --i) #define pb push_back #define pf push_front #define fi first #define se second #define all(a) a.begin(), a.end() #define len(a) (int)a.size() typedef long long ll; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<int> vi; typedef vector<double> vd; typedef vector<string> vs; typedef vector<ll> vll; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; double a[n+1] = {}, b[n+1] = {}, s1 = 0, s2 = 0, ma = 0; rep (i,0,n-1) { cin >> a[i] >> b[i]; } sort(a,a+n,greater<double>()); sort(b,b+n,greater<double>()); rep (i,0,n) { s2 = 0; rep (j,0,n) { ma = max(ma, min(s1, s2)-i-j); s2 += b[j]; } s1 += a[i]; } cout << fixed << setprecision(4) << ma << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...