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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin() , w.end());
int cur = 0;
vector < int > ret;
for(int i = (int)w.size()-1;i>=0;i--){
if(cur >= l and cur <= u)break;
if(cur + w[i] > u)continue;
else{
ret.push_back(w[i]);
cur += w[i];
}
if(cur >= l and cur <= u)break;
}
if(cur >= l and cur <= u)return ret;
else return vector<int>();
}
# | 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... |