# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442090 | tmp_bad | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
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 <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#include "grader.cpp"
using namespace std;
typedef long long ll;
vector<int> find_subset(int L, int U, vector<int> w) {
sort(w.begin(), w.end());
int l = 0, r = -1;
ll sum = 0;
vector<int> res;
while (r < w.size()) {
if (sum >= L && sum <= U) {
for (int i = l; i <= r; i++) {
res.push_back(w[i]);
}
break;
}
if (sum >= L)
sum -= w[l++];
else if (sum < L)
sum += w[++r];
}
return res;
}