oj.uz

Submission #865313

# Submission time Handle Problem Language Result Execution time Memory
865313 2023-10-24T07:22:26 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 2396 KB 
//gm  --- akezhon
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NET r < tl || tr < l
#define double long double
using namespace std;
const int N=1e5+7;
const int M=1e9+7;
const int inf=1e9;
int n;
double a[N], b[N];
void AlemAmenov(){
	
	cin >> n;
	for(int i=1; i <= n; i++){
		cin >> a[i] >> b[i];
	}
	sort(a+1, a+1+n);
	sort(b+1, b+1+n);
	reverse(a+1, a+1+n);
	reverse(b+1, b+1+n);
	int c1=0, c2=0;
	double ans = 0;
	for(int i=1; i <= n; i++){
		a[i] += a[i-1];
		b[i] += b[i-1];
	}
	while(a[c1] - c1 - c2 <= 0 && c1 <= n){
		c1++;
		ans = max(ans, min(a[c1], b[c2]) - c1 - c2);
		while(b[c2] - c1 - c2 <= 0 && c2 <= n){
			c2++;
			ans = max(ans, min(a[c1], b[c2]) - c1 - c2);
		}
		ans = max(ans, min(a[c1], b[c2]) - c1 - c2);
	}
	cout << fixed << setprecision(4) << ans;
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	// freopen("promote.in", "r", stdin);
	// freopen("promote.out", "w", stdout);
	int RealName=1;
	// cin >> RealName;
	// int C=0;
	while(RealName--){
		// cout << "Case " << ++C << ":\n";
		AlemAmenov();
	}

return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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