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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
vector<int> find_subset(int l,int u,vector<int> w){
    int n=w.size();
    vector<int> res,res2;
    vector<pair<ll,int> > v;
    vector<ll> v2;
    for(int i=0;i<n;i++)
        v.pb(mp(w[i],i+1));
    sort(v.begin(),v.end());
    //v2.pb(1e12);
    for(int i=0;i<n;i++)v2.pb(v[i].ff);
    v2.pb(1e12);
    vector<ll>::iterator it;
    ll sum=0;
    for(int i=0;i<n;i++){
        sum+=v[i].ff;
        res.pb(v[i].ss);
        if(sum>=l)break;
        it=upper_bound(v2.begin(),v2.end(),l-sum-1);
        int idx=(it-v2.begin());
        if(v2[idx]==1e12)continue;
        if(idx<=i)continue;
        sum+=v2[idx];
        res.pb(v[idx].ss);
        break;
    }
    if(sum<l)return res2;
    if(sum>u)return res2;
    return res;
}
/*
MMMM
*/
| # | 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... |