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;
#define ll long long
#define pb push_back
#define MAXN 200007
ll w[MAXN];
ll prefsum[MAXN];
vector<int> find_subset(int l, int u, vector<int> w)
{
    ll n=w.size();
    sort(w.begin(),w.end());
    prefsum[0]=0;
    for(int i=1;i<=n;i++) prefsum[i]=prefsum[i-1]+w[i-1];
    ll itr1=0,itr2=1;
    vector<int> v;
    while(itr2<=n)
    {
        if(prefsum[itr2]-prefsum[itr1]>u) itr1++;
        else if(prefsum[itr2]-prefsum[itr1]<l) itr2++;
        else
        {
            for(int i=itr1+1;i<=itr2;i++) v.pb(w[i]);
            break;
        }
    }
    return v;
}
| # | 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... |