Submission #873927

#	Time	Username	Problem	Language	Result	Execution time	Memory
873927		noiaint	Gym Badges (NOI22_gymbadges)	C++17	100 / 100	163 ms	22988 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
 
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1 << (x))
#define popcount __builtin_popcountll
 
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
    return l + rd() % (r - l + 1);
}
 
const int N = 1e6 + 5;
const int mod = 1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int inf = 1e9; // INT_MAX;
const long long llinf = 1e18; // LLONG_MAX;
 
template<class X, class Y>
bool minimize(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
 
template<class X, class Y>
bool maximize(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
 
template<class X, class Y>
bool add(X &a, Y b) {
    a += b;
    while (a >= mod) a -= mod;
    while (a < 0) a += mod;
    return true;
}
 
int n;
pair<long long, long long> a[N];
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i].fi;
    for (int i = 1; i <= n; ++i)
        cin >> a[i].se;
 
    sort(a + 1, a + n + 1, [&] (pair<long long, long long> x, pair<long long, long long> y) {
        return x.fi + x.se < y.fi + y.se;
    });
 
    priority_queue<long long> q;
    int level = 0, res = 0;
    for (int i = 1; i <= n; ++i) {
        level += a[i].fi;
        q.push(a[i].fi);
        while (level > a[i].fi + a[i].se) {
            level -= q.top();
            q.pop();
        }
        res = max(res, (int) q.size());
    }
 
    cout << res;
 
    return 0;
}
 
/*
 
*/

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