Submission #956951

#TimeUsernameProblemLanguageResultExecution timeMemory
956951FEDIKUSSure Bet (CEOI17_sure)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100100; int n; double A[MAX_N], B[MAX_N]; int main() { // Ulaz cin>>n; for(int i=0;i<n;i++) { cin>>A[i]>>B[i]; } // Obrada sort(A, A+n); sort(B, B+n); double rez = 0; double profit = 0, loss = 0; double sumA = 0, sumB = 0; int a = n-1, b = n-1; while(a != -1 and b != -1) { loss++; if(sumA <= sumB) { if(a==-1) break; sumA += A[a]; profit += A[a]; a--; } else { if(b==-1) break; sumB += B[b]; profit += B[b]; b--; } if(profit - loss > rez) { rez = profit - loss; } } // Izlaz cout<<rez<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...