Submission #493398

#	Time	Username	Problem	Language	Result	Execution time	Memory
493398		MilosMilutinovic	Sure Bet (CEOI17_sure)	C++14	100 / 100	89 ms	3520 KiB

sure

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=105000;
int n;
db a[N],b[N];

int main() {
    scanf("%d",&n);
    rep(i,1,n+1) scanf("%lf%lf",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);
    rep(i,1,n+1) a[i]=a[i]+a[i-1];
    rep(i,1,n+1) b[i]=b[i]+b[i-1];
    int ptr=1;
    db ans=0;
    rep(i,1,n+1) {
        while (ptr+1<=n&&min(a[i]-(i+ptr),b[ptr]-(i+ptr))<min(a[i]-(i+ptr+1),b[ptr+1]-(i+ptr+1))) {
            ptr++;
        }
        ans=max(ans,min(a[i]-(i+ptr),b[ptr]-(i+ptr)));
    }
    printf("%.4lf",ans);
}

Compilation message (stderr)

sure.cpp: In function 'int main()':
sure.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
sure.cpp:28:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     rep(i,1,n+1) scanf("%lf%lf",a+i,b+i);
      |                  ~~~~~^~~~~~~~~~~~~~~~~~

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