Submission #255655

#	Time	Username	Problem	Language	Result	Execution time	Memory
255655		Haunted_Cpp	Sure Bet (CEOI17_sure)	C++17	100 / 100	129 ms	4524 KiB

sure

/**
 * author: Haunted_Cpp
**/
 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
 
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
 
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif

const int MAX_N = 1e3 + 5;

vector<double> a, b;
vector<double> pre;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  a.resize(n); b.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  sort(a.rbegin(), a.rend());
  sort(b.rbegin(), b.rend());
  pre.resize(n + 1);
  pre[0] = 0;
  for (int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] + b[i - 1];
  }
  double mx = 0;
  double res_a = 0;
  for (int i = 0; i <= n; i++) {
    if (i) res_a += a[i - 1];
    int l = 0, r = n;
    while(l < r) {
      int m1 = l + (r - l) / 3;
      int m2 = r - (r - l) / 3;
      double f1 = min(res_a, pre[m1]) - m1 - i;
      double f2 = min(res_a, pre[m2]) - m2 - i;
      if (f1 < f2) {
        l = m1 + 1;
      } else {
        r = m2 - 1;
      }
    } 
    mx = max(mx, min(res_a, pre[r]) - r - i);
  }
  cout << fixed << setprecision(4) << mx << '\n';
  return 0;
}

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