# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969106 | TrendBattles | Gym Badges (NOI22_gymbadges) | C++14 | 106 ms | 4348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//https://oj.uz/problem/view/NOI22_gymbadges
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
#define INFILE "NOI22_gymbadges.inp"
#define OUTFILE "NOI22_gymbadges.ans"
int main() {
ios::sync_with_stdio(0); cin.tie(0);
if (fopen(INFILE, "r")) {
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
}
int N; cin >> N;
vector <int> X(N), L(N);
for (int& v : X) cin >> v;
for (int& v : L) cin >> v;
if (*max_element(L.begin(), L.end()) == *min_element(L.begin(), L.end())) {
sort(X.begin(), X.end());
int ans = N;
lli sum = 0;
for (int i = 0; i < N; ++i) {
sum += X[i];
if (sum > L[0]) {
ans = i; break;
}
}
cout << ans;
return 0;
}
vector <int> order(N); iota(order.begin(), order.end(), 0);
sort(order.begin(), order.end(), [&] (int u, int v) {
return L[u] < L[v];
});
const lli inf = 0x3f3f3f3f3f3f3f3f;
vector <lli> dp(N + 1, inf);
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = N; j; --j) {
if (dp[j - 1] <= L[order[i]]) {
dp[j] = min(dp[j], dp[j - 1] + X[order[i]]);
}
}
}
for (int i = N; i >= 0; --i) {
if (dp[i] < inf) {
cout << i; return 0;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |