Submission #998747

#	Time	Username	Problem	Language	Result	Execution time	Memory
998747		LOLOLO	Gym Badges (NOI22_gymbadges)	C++17	24 / 100	144 ms	13900 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e6 + 10;
int x[N], l[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> x[i];

    vector <int> order;
    for (int i = 1; i <= n; i++) {
        cin >> l[i];
        order.pb(i);
    }

    sort(all(order), [&] (int a, int b) { return make_pair(x[a] + l[a], -x[a]) < make_pair(x[b] + l[b], -x[b]);});
    priority_queue <ll> pq;
    ll sum = 0;

    for (auto i : order) {
        if (sum <= l[i]) {
            sum += x[i];
            pq.push(x[i]);
        } else {
            if (pq.empty())
                continue;

            ll t = pq.top();
            if (t > x[i] && sum - t + x[i] <= l[i]) {
                pq.pop();
                pq.push(x[i]);
                sum += (x[i] - t);
            }
        }
    }

    cout << sz(pq) << '\n';

    return 0;
}

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