이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<ii> wsorted;
for (unsigned int i = 0; i < w.size(); i++) wsorted.push_back({w[i], i});
sort(wsorted.begin(), wsorted.end(), greater<ii>());
int totWeight = 0;
vector<int> res;
for (auto el : wsorted) {
int weight, i;
tie(weight, i) = el;
if (totWeight + weight <= u) {
totWeight += weight;
res.push_back(i);
}
if (totWeight >= l) return res;
}
return std::vector<int>(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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |