/*
Zadanie: Detecting Molecules
Autor: Tomasz Kwiatkowski
*/
#include <bits/stdc++.h>
#include "molecules.h"
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 7;
const int INF = 1e9 + 7;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> molecules(n);
for (int i = 0; i < n; ++i)
molecules[i] = {w[i], i};
sort(molecules.begin(), molecules.end());
vector<int> ans;
int right = 0;
ll sum = 0;
for (int left = 0; left < n; ++left) {
while (right < n && sum + molecules[right].fi <= u) {
sum += molecules[right].fi;
if (l <= sum) {
for (int i = left; i <= right; ++i)
ans.pb(molecules[i].se);
return ans;
}
++right;
}
sum -= molecules[left].fi;
right = max(right, left);
}
return ans;
}
