oj.uz

Submission #878696

# Submission time Handle Problem Language Result Execution time Memory
878696 2023-11-25T05:44:15 Z Faisal_Saqib Sure Bet (CEOI17_sure) C++17
20 / 100
 1 ms 348 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
int main()
{
    cout<<fixed<<setprecision(4);
	int n;
	cin>>n;
	vector<double> a,b;
	for(int i=0;i<n;i++)
	{
		double x,y;
		cin>>x>>y;
		a.push_back(x);
		b.push_back(y);
	}
	sort(rbegin(a),rend(a));
	sort(rbegin(b),rend(b));
	vector<double> pre0,pre1;
	pre1=pre0={0};
	for(int i=0;i<n;i++)
	{
		pre0.push_back(pre0.back()+a[i]);
		pre1.push_back(pre1.back()+b[i]);
	}
	pre1.push_back(pre1.back());
	pre0.push_back(pre0.back());
	int j=0;
	double ans=0;
	n++;
	for(int i=0;i<n;i++)
	{
		while(j<n and pre1[j]<pre0[i])
		{
			j++;
		}
		if(pre0[j]<=pre1[i])
			ans=max(ans,pre0[i]-i-j);
	}
	j=0;
	for(int i=0;i<n;i++)
	{
		while(j<=n and pre0[j]<pre1[i])
		{
			j++;
		}
		if(pre0[j]>=pre1[i])
			ans=max(ans,pre1[i]-i-j);
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -