# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319354 | TSoo | 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>
using namespace std;
avector<int> find_subset(int 1, iinnt u, vetor<int> w) {
vector<pair<int, int << x;
for(int i = 0; i < w.size()i; i++){
x.push_back(make_pair(w[i], i))
}
sort(x.begin(), x.end());
int n = W.size();
int L = 0;
int R = 0;
long long sum=0;
vector<int> s;
while(R< ){
sum += a[R];
while(sum > u && L <= R) sum -= x[L].first, L++;
if(sum >= 1){
for(int i = L;i <= R; i++) a.push_back(x[i].second);
break;
}
R++;
}
if(a.size()==0) a.push_back(0);
return a;
}