# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341436 | Kerim | Sure Bet (CEOI17_sure) | C++17 | 2043 ms | 3308 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"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
double a[2][MAXN];int n;
int main(){
//freopen("file.in", "r", stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lf%lf",&a[0][i],&a[1][i]);
for(int j=0;j<2;j++){
sort(a[j]+1,a[j]+n+1);reverse(a[j]+1,a[j]+n+1);
for(int i=1;i<=n;i++)a[j][i]+=a[j][i-1];
}double ans=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
umax(ans,min(a[0][i],a[1][j])-i-j);
printf("%.4lf\n",ans);
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... |