# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284600 | 2020-08-27T17:21:06 Z | triplem5ds | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include "molecules.h" #include "bits/stdc++.h" using namespace std; std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<int> v; for(int i = 0; i < w.size(); i++)v.push_back(i); sort(v.begin(),v.end(), [&](int x, int y){return w[x] < w[y]}); if(accumulate(w.begin(),w.end(),0ll) < l || w[v[0]] > u)return vector<int>(); vector<int> ret; int sum = 0; for(int j = 0; sum < l; j++){ sum += w[v[j]]; ret.push_back(v[j] + 1); } return ret; }