| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1218223 | cpismayilmmdv985 | Topical (NOI23_topical) | C++20 | 2 ms | 328 KiB |
#include <bits/stdc++.h>
int main() {
using namespace std;
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int N, K; cin >> N >> K;
vector<array<int, 2>> A(N);
for (auto &a : A) cin >> a[0];
for (auto &a : A) cin >> a[1];
sort(A.begin(), A.end());
int P = 0, cnt = 0;
for (auto &a : A) {
if (a[0] > P)
break;
P += a[1];
cnt++;
}
cout << cnt;
return 0;
}
| # | 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... | ||||
