답안 #1027192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027192 2024-07-19T01:54:50 Z vjudge1 Sure Bet (CEOI17_sure) C++17
100 / 100
69 ms 3520 KB
#include "bits/stdc++.h"
using namespace std;

#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif

#define int long long

const int N=1e5+5;
const int mod=1e9+7;

int n;
double a[N],b[N],p1[N],p2[N];
void sol(){
	cin>>n;
	for(int i=1; i<=n; i++) cin>>a[i]>>b[i];
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	reverse(a+1,a+n+1);
	reverse(b+1,b+n+1);
	for(int i=1; i<=n; i++) p1[i]=p1[i-1]+a[i];
	for(int i=1; i<=n; i++) p2[i]=p2[i-1]+b[i];
	auto f2 = [&](double x) -> int{
		int l=1,r=n,ans=-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(p2[mid]-x>=0.0){
				ans=mid;
				r=mid-1;
			}else l=mid+1;
		}
		return ans;
	};
	auto f1 = [&](double x) -> int{
		int l=1,r=n,ans=-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(p1[mid]-x>=0.0){
				ans=mid;
				r=mid-1;
			}else l=mid+1;
		}
		return ans;
	};
	double ans=0;
	for(int i=1; i<=n; i++){
		int j=f2(p1[i]);
		if(j==-1) continue;
		ans=max(ans,p1[i]-i-j);
	}
	for(int i=1; i<=n; i++){
		int j=f1(p2[i]);
		if(j==-1) continue;
		ans=max(ans,p2[i]-i-j);
	}
	cout<<fixed<<setprecision(4)<<ans;
}
signed main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // freopen(".inp", "r", stdin);
    // freopen(".out", "w", stdout);
    int tt=1;
    //cin>>tt; 
    while(tt--){
    	sol();
    }
    cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 60 ms 3392 KB Output is correct
18 Correct 69 ms 3412 KB Output is correct
19 Correct 59 ms 3404 KB Output is correct
20 Correct 56 ms 3408 KB Output is correct
21 Correct 64 ms 3412 KB Output is correct
22 Correct 61 ms 3488 KB Output is correct
23 Correct 60 ms 3408 KB Output is correct
24 Correct 61 ms 3412 KB Output is correct
25 Correct 55 ms 3396 KB Output is correct
26 Correct 60 ms 3520 KB Output is correct