This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int, int>> ww;
for (size_t i = 0; i < w.size(); ++i)
ww.push_back({w[i], i});
sort(ww.begin(), ww.end());
int cur = 0;
vector<int> result;
for (int i = w.size() - 1; i >= 0; --i) {
if (cur + ww[i].first < l) {
cur += ww[i].first;
result.push_back(ww[i].second);
} else if (cur + ww[i].first <= u) {
cur += ww[i].first;
result.push_back(ww[i].second);
break;
}
}
if (cur >= l) {
sort(result.begin(), result.end());
return result;
} else {
return {};
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |