#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
vector<int> find_subset(int l, int u, vector<int> w) {
    int n=w.size();
    vector<pair<long long,int>> v;
    for(int i=0;i<n;i++){
		v.push_back({w[i], i});
	}
	vector<int> ans;
	vector<long long> ps(n, 0);
	ps[0]=v[0].f;
	for(int i=1;i<n;i++)ps[i]=ps[i-1]+v[i].f;
	
	//~ sort(v.begin(),v.end());
		//~ for(auto it: v){
		//~ printf(" (%lld, %lld) ", it.f, it.s);
	//~ }
	//~ cout<<endl;
	int sz=lower_bound(ps.begin(),ps.end(), l)-ps.begin();
	if(sz == n){
		return ans;
	}
	if (ps[sz] <= u){
		for(int i=0;i<=sz;i++){
			ans.push_back(v[i].s);
		}
		return ans;
	}
	for(int r=sz;r<n;r++){
		int cand=ps[r]-ps[r-sz];
		if(cand >= l and cand <= u){
			for(int j=r-sz+1;j<=r;j++){
				ans.push_back(v[j].s);
			}
			return ans;
		}
	}
	
	return ans;
}
Compilation message (stderr)
molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~| # | 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... |