Submission #2856949

---

Source Code Expand

#include<bits/stdc++.h>
#include<numeric>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n)  int(n);cin >> (n)
#define LCIN(n) LL(n);cin >> (n)
#define SCIN(n) string(n);cin >> (n)
#define YES(n) cout<<((n)? "YES" : "NO")<<endl
#define Yes(n) cout<<((n)? "Yes" : "No")<<endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) <<endl

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)

#define FOREACH(x,a) for(auto& (x) : (a) )

#define ALL(obj) (obj).begin(),(obj).end()

#define P pair<LL,LL>
#define I vector<int>
#define S set<int>
#define pb(v) push_back(v)
#define V vector
#define rt return
#define rmsame(a) sort(ALL(a)),a.erase(unique(ALL(a)), a.end())

typedef string::const_iterator State;
class PalseError {};
class Edge{
public:
    LL from,to,value;
    Edge(LL a,LL b,LL c){
        from = a;
        to = b;
        value = c;
    }
    Edge(LL a,LL b){
        from = a;
        to = b;
    }
};

int main(){
    CIN(N);
    V<P> vec;
    REP(a,N){
        CIN(b);
        vec.pb(make_pair(b,a+1));
    }
    sort(ALL(vec));
    LL ruiseki[1000000];
    ruiseki[0]=0;
    REP(a,N){
        ruiseki[a+1]=ruiseki[a]+vec.at(a).first;
    }
    int a;
    int ins=0;
    for(a = 0;a < N-1;a++){
        if(!(vec.at(a+1).first <= ruiseki[a+1]*2)){
            ins = a+1;
            break;
        }
    }
    COUT(N-ins);
    return 0;
}

Submission Info

Judge Result