# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919629 | Nurislam | 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();
vector<pair<int,int> > res;
for(int i = 0; i < n; i++)res.pb({w[i], i});
sort(res.begin(), res.end());
int l = 0, r = 0, sum = 0;
while(r < n){
while(sum > r){
sum -= res[l++].first;
}
if(sum > l){
vector<int> ans;
for(int i = l; i <= r; i++){
ans.pb(res[i].second);
}return ans;
}
sum+=res[r++].first;
}
}