oj.uz

Submission #121313

# Submission time Handle Problem Language Result Execution time Memory
121313 2019-06-26T10:14:23 Z killB0x Sure Bet (CEOI17_sure) C++14
0 / 100
 2 ms 384 KB 
using namespace std;
    #include <bits/stdc++.h>
    typedef long long int ll;
    typedef unsigned long long int ull;
    typedef pair<int,int> ii;
    typedef pair<ll,ll> dl;
    typedef vector<ii> vii;
    typedef vector<dl> vdll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<string> vs;
    #define pb push_back
    #define mp make_pair
    #define ft first
    #define sc second
    #define in insert
    #define bs binary_search
    #define INF LLONG_MAX
    #define rc(s) return cout << s,0
    #define int ll
    const ll mod=1e9+7;
    const int N=100005;
    #define int ll
    /*----------------------------*/
    int ps1[1005],ps2[1005];
    /*----------------------------*/
    int32_t main() {
    	//freopen("sol.in","r",stdin);
    	//freopen("sol.out","w",stdout);
        /**///------------------------///**/
        /**/ios::sync_with_stdio(false);/**/
        /**///------------------------///**/
        int n;
	cin>>n;
    	double a,b;
    	vector<double> x,y;
    	for(int i=1;i<=n;i++)cin>>a>>b,x.pb(a),y.pb(b);
    	sort(x.begin(),x.end());
    	sort(y.begin(),y.end());
    	reverse(x.begin(),x.end());
    	reverse(y.begin(),y.end());
    	for(int i=1;i<=n;i++)ps1[i]=ps1[i-1]+x[i-1];
    	for(int i=1;i<=n;i++)ps2[i]=ps2[i-1]+y[i-1];
    	double ans=0;
    	int inda=0,indb=0;
	a=0,b=0;
		while(inda<n&&indb<n)
		{
		    if(a<b)
			{
				a+=x[inda];
				inda++;
			}
			else
			{
				b+=y[indb];
				indb++;
			}
			ans=max(ans,min(a-inda-indb,b-inda-indb));
		}
    	printf("%.4lf",(double)ans);
       	//THIS IS IS THE END
    }

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -