제출 #1027268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1027268		BuiDucManh123	Sure Bet (CEOI17_sure)	C++14	100 / 100	88 ms	1900 KiB

sure

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define taskname ""
using namespace std;
ll n,i,l,r,mid;
double a[100009],b[100009],ans=0.0,ma,ans1,k;
int main() {
	if (fopen(taskname".inp","r")) {
		freopen(taskname".inp","r",stdin);
		freopen(taskname".out","w",stdout);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a[i]>>b[i];
    }sort(a+1,a+n+1,greater<>());
    sort(b+1,b+n+1,greater<>());
    for(i=1;i<=n;i++)
        a[i]+=a[i-1];
    for(i=1;i<=n;i++)
        b[i]+=b[i-1];
    for(i=0;i<=n;i++){
        ans1=a[i]-i;
        l=0;r=n;ma=0.0;
        while(l<=r){
            mid=(l+r)/2;
            k=min(ans1-mid,double(b[mid])-mid-i);
            if(k>=ma){
                ma=k;
                //if(i==3&&mid==1) cout<<k<<"\n";
                if(double(b[mid])-mid-i>ans1-mid) r=mid-1;
                else if(double(b[mid])-mid-i<ans1-mid) l=mid+1;
                else break;
            }else{
                if(double(b[mid])-mid-i<ans1-mid) l=mid+1;
                else r=mid-1;
            }
        }//if(i==4) cout<<ma;
        if(ans<ma) ans=ma;
        //cout<<ans<<"\n";
        //if(ans==1.1000) cout<<i<<"\n";
    }
    printf("%.4lf",(double)ans);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sure.cpp: In function 'int main()':
sure.cpp:15:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |   freopen(taskname".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:16:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   freopen(taskname".out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40