# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919635 | 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;
#define int long long
#define pb push_back
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
pair<int,int> rw[n];
for(int i = 0; i < n; i++){
rw[i] = {w[i], i};
}
vector<int> ans;
sort(rw, rw+n);
int i = 0, r = 0, sum = 0;
while(r < n){
while(sum > r){
sum -= rw[i++].first;
}
if(sum > l){
for(; i <= r; i++){
ans.pb(rw[i].second);
}return ans;
}
sum+=rw[r++].first;
}
return ans;
}