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;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
    ll n = w.size();
    vector<pair<ll, ll>> v;
    for (ll i = 0; i < n; i++) {
        v.emplace_back(w[i], i);
    }
    sort(v.begin(), v.end());
    ll s = 0, h = 0, t = 0;
    while (h < n) {
        while (t < n && s < l) {
            s += v[t].first;
            t++;
        }
        if (l <= s && s <= u) {
            vector<int> ans;
            for (ll i = h; i < t; i++) ans.emplace_back(v[i].second);
            return ans;
        }
        s -= v[h++].first;
    }
    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... |