Submission #860908

#TimeUsernameProblemLanguageResultExecution timeMemory
860908vjudge1Sure Bet (CEOI17_sure)C++17
0 / 100
0 ms348 KiB
#include <iostream> #include <vector> #include <algorithm> #include <iomanip> using namespace std; bool srt(float a, float b) { return a > b; } int main() { int n, f = 0, s = 0; float fsum = 0, ssum = 0, res = 0; cin >> n; vector<float> a(n), b(n); for(int i = 0; i < n; i++) cin >> a[i] >> b[i]; sort(a.begin(), a.end(), srt); sort(b.begin(), b.end(), srt); fsum = a[0]; f++; while(f < n && s < n) { if(fsum > ssum) { while(fsum > ssum && s < n) { ssum+=b[s]; s++; res = max(res, min(fsum, ssum)-f-s); } } else { while(ssum > fsum && f < n) { fsum+=a[s]; f++; res = max(res, min(fsum, ssum)-f-s); } } } cout << fixed << setprecision(4) << res << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...