| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 219223 |
2020-04-04T16:06:21 Z |
Fasho |
Sure Bet (CEOI17_sure) |
C++14 |
|
174 ms |
8568 KB |
#include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;
long double m,ar[N],sum,t,a[N],b[N],prefa[N],prefb[N];
ll n;
bool srt(long double x,long double y)
{
return x>y;
}
int main()
{
fast;
cin>>n;
fo(i,1,n)
cin>>a[i]>>b[i];
sort(a+1,a+n+1,srt);
sort(b+1,b+n+1,srt);
fo(i,1,n)
prefa[i]=prefa[i-1]+a[i];
fo(i,1,n)
prefb[i]=prefb[i-1]+b[i];
int l=0,r=0;
while(l<=n && r<=n)
{
long double x=min(prefa[l],prefb[r]);
// cout<<x<<sp<<l<<sp<<r<<endl;
sum=max(sum,x-l-r);
if(prefa[l]>prefb[r])
r++;
else
l++;
}
cout<<fixed<<setprecision(4)<<sum;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
6 ms |
512 KB |
Output is correct |
| 13 |
Correct |
6 ms |
512 KB |
Output is correct |
| 14 |
Correct |
6 ms |
512 KB |
Output is correct |
| 15 |
Correct |
6 ms |
512 KB |
Output is correct |
| 16 |
Correct |
6 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
6 ms |
512 KB |
Output is correct |
| 13 |
Correct |
6 ms |
512 KB |
Output is correct |
| 14 |
Correct |
6 ms |
512 KB |
Output is correct |
| 15 |
Correct |
6 ms |
512 KB |
Output is correct |
| 16 |
Correct |
6 ms |
512 KB |
Output is correct |
| 17 |
Correct |
138 ms |
7928 KB |
Output is correct |
| 18 |
Correct |
141 ms |
8112 KB |
Output is correct |
| 19 |
Correct |
174 ms |
8056 KB |
Output is correct |
| 20 |
Correct |
138 ms |
8056 KB |
Output is correct |
| 21 |
Correct |
156 ms |
8568 KB |
Output is correct |
| 22 |
Correct |
145 ms |
8056 KB |
Output is correct |
| 23 |
Correct |
136 ms |
8056 KB |
Output is correct |
| 24 |
Correct |
139 ms |
7996 KB |
Output is correct |
| 25 |
Correct |
139 ms |
8160 KB |
Output is correct |
| 26 |
Correct |
156 ms |
8440 KB |
Output is correct |
