# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
607410 | UncoolAnon | Sure Bet (CEOI17_sure) | C++14 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
int n;
cin>>n;
vector<double> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
double answer=0;
vector<int> A,B;
double curA=0,num=0;
for(int i=0;i<n;i++){
if(a[i]<1&&b[i]<1){}
else{
A.push_back(i);
B.push_back(i);
}
}
sort(A.begin(),A.end(),[&](int i,int j){
if(a[i]==a[j]) return b[i]>b[j];
return a[i]>a[j];
});
sort(B.begin(),B.end(),[&](int i,int j){
if(b[i]==b[j]) return a[i]>a[j];
return b[i]>b[j];
});
for(int&i:A){
++num;
curA+=a[i];
double curB=0;
for(int&j:B){
curB+=b[j];
++num;
answer=max(answer,min(curB,curA)-num);
}
num-=B.size();
}
cout<<answer;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |