Submission #756119

#	Time	Username	Problem	Language	Result	Execution time	Memory
756119		browntoad	Gym Badges (NOI22_gymbadges)	C++14	100 / 100	214 ms	14760 KiB

Main

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pip pair<int, pii>
#define pdd pair<double ,double>
#define pcc pair<char, char>
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const ll iinf = 2147483647;
const ll mod = 1e9+7;
const ll maxn=3e5+5;
const ll maxm=105;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2,m);
}

bool cmp(pii a, pii b){
	return a.f+a.s < b.f+b.s;
}
int n;
vector<pii> vc;
void inp(){
    cin>>n;
    vc = vector<pii> (n);
    REP(i, n) cin>>vc[i].s;
    REP(i, n) cin>>vc[i].f;
}
int run(){
    sort(ALL(vc), cmp);
    int cnt = 0, ans = 0;
    priority_queue<int> pq;
    REP(i, n){
        cnt += vc[i].s;
        pq.push(vc[i].s);
        while(cnt > vc[i].f+vc[i].s){
            cnt -= pq.top();
            pq.pop();
        }
        ans = max(ans, SZ(pq));
    }
    return ans;
}
int run2(){
    sort(ALL(vc), cmp);
}
signed main(){
    IOS();
    inp();
    cout<<run()<<endl;

}
/*
3
3 4 2
2 1 3
*/

Compilation message (stderr)

Main.cpp: In function 'long long int run2()':
Main.cpp:83:1: warning: no return statement in function returning non-void [-Wreturn-type]
   83 | }
      | ^

• Subtask 1: 15 / 15
• Subtask 2: 9 / 9
• Subtask 3: 27 / 27
• Subtask 4: 49 / 49