# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849656 | Bach21 | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
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>
#include "molecules.h"
using namespace std;
vector<long long> find_subset(int l, int u, vector<long long> w)
{
vector<pair<long long,long long>> w1;
int n=w.size();
for (int i=0;i<n;i++)
{
w1.push_back({w[i],i});
}
long long sum=0;
vector<long long> res;
sort(w1.begin(),w1.end());
for (int i=0,j=0;j<n;j++)
{
sum+=w1[j].first;
while (sum>u)
{
sum-=w1[i++].first;
}
if (sum>=l)
{
for (int k=i;k<=j;k++)
{
res.push_back(w1[k].second);
}
break;
}
}
return res;
}