Submission #1157580

---

Source Code Expand

#include "bits/stdc++.h"
#ifndef err
#define err(...)(void)0
#endif
using namespace std;
using ll = long long;
using ull = decltype(1ull);
template<class T>int size(T&&a) { return a.size(); }
#define REP(t,a)for(typename make_signed<decltype(a.second)>::type t=a.first,_l##t=a.second;t<_l##t;t++)
#define RREP(t,a)for(typename make_signed<decltype(a.second)>::type t=a.second-1,_l##t=a.first;t>=_l##t;t--)
template<class B>pair<int, B>make_pair(B b) { return{ 0,b }; }
#define rep(t,...)REP(t,make_pair(__VA_ARGS__))
#define rrep(t,...)RREP(t,make_pair(__VA_ARGS__))
#define all(a)begin(a),end(a)
#define rall(a)a.rbegin(),a.rend()

void Calc();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr); cin.exceptions(istream::failbit | istream::badbit);
  cout << fixed << setprecision(15); Calc(); cout.flush(); return 0;
}
template<class A>void amax(A&a, A b) { a = max(a, b); }
template<class A>void amin(A&a, A b) { a = min(a, b); }
struct Scanner {
  template<class A = string>A Next() { A a; cin >> a; return a; }
  template<class A = int>vector<A>Array(int n) { vector<A>a(n); for (A&i : a) cin >> i; return a; }
  string Line() const { string s; getline(cin, s); return s; }
  template<class A>Scanner&operator,(A&a) { a = Next<A>(); return *this; }
  template<class A>operator A() { return Next<A>(); }
}in;

/*---------------------------------------------------------------------*/


void Calc() {
  int n = in;
  struct Data {
    int i, a;
    void In() {
      in, a;
    }
    bool operator<(const Data&d)const {
      return a < d.a;
    }
  };
  vector<Data> d(n);
  rep(i, n) {
    d[i].In();
    d[i].i = i;
  }
  sort(all(d));

  int cnt = 0;
  auto solve = [&](int mid) {
    ll now = d[mid].a;
    rep(i, n) {
      if (i == mid)continue;
      if (d[i].a <= now * 2) {
        now += d[i].a;
      } else {
        return false;
      }
    }
    return true;
  };
  int l = 0, r = n;
  while (r - l > 0) {
    int mid = (r + l) / 2;
    if (solve(mid)) r = mid;
    else l = mid + 1;
  }
  err(l, r, n);
  cout << (n-l) << endl;

}

Submission Info

Judge Result