# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672654 | mseebacher | Detecting Molecules (IOI16_molecules) | C++17 | 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>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int,int>> zwischen;
for(int i = 0;i<n;i++){
zwischen.push_back({w[i],i});
}
sort(zwischen.begin(),zwischen.end());
int left = 0;
ll sum = 0;
for(int r = 0;r<n;r++){
sum += zwischen[r].first;
if(sum > u){
sum -= zwischen[left].first;
left++;
}
if(sum >= l){
vector<int> erg;
for(int i = left;i<=r;i++){
erg.push_back(zwischen[i].second);
}
return erg;
}
}
return {};
}