oj.uz

Submission #584814

# Submission time Handle Problem Language Result Execution time Memory
584814 2022-06-28T04:10:45 Z amunduzbaev Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 212 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	vector<double> a(n), b(n);
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i];
	}
	sort(a.rbegin(), a.rend());
	sort(b.rbegin(), b.rend());
	for(int i=1;i<n;i++){
		a[i] += a[i-1];
	}
	for(int i=1;i<n;i++){
		b[i] += b[i-1];
	}
	double res = 0;
	for(int i=0;i<n;i++){
		int j = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
		res = max(res, a[i] - i - j - 2);
	}
	
	for(int i=0;i<n;i++){
		int j = lower_bound(a.begin(), a.end(), b[i]) - a.begin();
		res = max(res, b[i] - i - j - 2);
	}
	
	cout<<fixed<<setprecision(4)<<res<<"\n";
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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