Submission #720409

#TimeUsernameProblemLanguageResultExecution timeMemory
720409thimote75Sure Bet (CEOI17_sure)C++14
20 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; #define fd vector<float> int main () { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; fd a(n); fd b(n); for (int i = 0; i < n; i ++) cin >> a[i] >> b[i]; sort(a.rbegin(), a.rend()); sort(b.rbegin(), b.rend()); for (int i = 1; i < n; i ++) { a[i] += a[i - 1]; b[i] += b[i - 1]; } float max_outcome = -1e18; for (int i = 0; i <= n; i ++) { for (int j = 0; j <= n; j ++) { max_outcome = max(max_outcome, min(i == 0 ? 0 : a[i - 1], j == 0 ? 0 : b[j - 1]) - (i + j)); } } printf("%.4lf", (double)max_outcome); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...