Submission #757930

#TimeUsernameProblemLanguageResultExecution timeMemory
757930roCatalystGym Badges (NOI22_gymbadges)C++14
9 / 100
419 ms5404 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
    int N;
    cin >> N;

    vector<int> X;
    for (int i = 0; i < N; i++) {
        int Xi;
        cin >> Xi;
        X.push_back(Xi);
    }

    vector<int> L;
    for (int i = 0; i < N; i++) {
        int Li;
        cin >> Li;
        L.push_back(Li);
    }

    int ans = 0;

    sort(X.begin(),X.end());
    ll currLevel = 0;
    ll cap = L.back();

    vector<int>::iterator p = X.begin();
    while ((currLevel <= cap)&&(p!=X.end())) {
        ans++;
        currLevel += *p;
        p++;
    }

    cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...