#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> idx(n);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(), [&](int a, int b) {
return w[a] < w[b];
});
long long total = 0;
for (int i : idx) total += w[i];
if (total < l) return {};
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += w[idx[i]];
if (sum >= l) {
return vector<int>(idx.begin(), idx.begin() + i + 1);
}
}
return {};
}
