| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1272544 | marshziin | Topical (NOI23_topical) | C++20 | 218 ms | 15944 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
if(k != 1) return 0;
vector<pii> r(n + 1);
for (int i = 1; i <= n; i++)
cin >> r[i].first ;
for (int i = 1; i <= n; i++)
cin >> r[i].second;
sort(r.begin(), r.end());
int ka = 0;
int res = 0;
for (int i = 1; i <= n; i++) {
if(ka >= r[i].first) {
ka += r[i].second;
res++;
}
else break;
}
cout << res << '\n';
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... | ||||
