Submission #1249936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249936		M_SH_O	Gym Badges (NOI22_gymbadges)	C++20	9 / 100	169 ms	37112 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    
    ll n;
    cin >> n;
    vpll a(n);
    vector<pair<pll, pll>> b;
    for(int i = 0; i < n; i ++){
        cin >> a[i].fr;
    }
    for(int i = 0; i < n; i ++){
        cin >> a[i].se;
        b.pb({{a[i].se+a[i].fr, a[i].se}, {a[i].fr, i}});
    }
    
    sort(b);
    multiset<ll> s;
    ll sum = 0;
    
    for(int i = 0; i < n; i ++){
        ll k = b[i].se.se;
        if(sum <= a[k].se){
            sum += a[k].fr;
            s.insert(a[k].fr);
        }
        else if(*--s.end() > a[k].se){
            sum -= *--s.end();
            sum += a[k].fr;
            s.erase(--s.end());
            s.insert(a[k].fr);
        }
    }
    
    cout << s.size() << endl;
}

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