제출 #1137268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137268		Shadow1	Gym Badges (NOI22_gymbadges)	C++20	100 / 100	159 ms	12484 KiB

Main

// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define read_vector(v) for(auto &x : v){cin >> x;}
#define vt vector
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int ll
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
const int INF = 1e15;

bool cmp(pii &a, pii &b) {
    return a.fir + a.sec < b.fir + b.sec;
}

void solve() {
    int n;
    cin >> n;
    vector<pii> a(n);
    for(auto &A : a)
        cin >> A.fir;
    for(auto &A : a)
        cin >> A.sec;

    sort(all(a), cmp);
    priority_queue<int> prq;
    int ans = 0, cur = 0, cnt = 0;
    for(int i=0; i<n; ++i) {
        if(cur <= a[i].sec) {
            cnt++;
            cur += a[i].fir;
            prq.push(a[i].fir);
        } else {
            if(!prq.empty()) {
                int x = prq.top();
                if(cur - x <= a[i].sec && x > a[i].fir) {
                    cur -= x;
                    cur += a[i].fir;
                    prq.pop();
                    prq.push(a[i].fir);
                }
            }
        }
        ans = max(ans, cnt);
    }

    cout << ans << '\n';
}






// CHECK YOUR OVERFLOWS!!!! 
signed main() {
    // freopen("output.txt", "w", stdout);
    // freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(NULL); 
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; ++tc) {
        // cout << "Case #" << tc << ": ";
        solve();
    }

    return 0;
}

/* CHECK :
1. COMPARATOR FUNCTION MUST RETURN FALSE WHEN ARGUMENTS ARE EQUAL!!!
2. Overflow! Typecase int64_t on operations if varaibles are int
3. Check array bounds!!!
4. Check array indexing!!!
5. Edge cases. (N==1)!!!
*/

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