# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347821 | nicholask | 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w) {
int n=w.size();
pair <int,int> a[n];
for (int i=0; i<n; i++) a[i]={w[i],i};
sort(a,a+n);
int st=0,sum=0;
for (int i=0; i<n; i++){
sum+=a[i].first;
while (sun>u) sum-=a[st++].first;
if (sum>=l){
vector <int> ans;
for (int j=st; j<=i; j++) ans.push_back(a[j].second);
}
}
return {};
}