# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319344 | barsbold | 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;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(), w.end());
int n = w.size();
int l =0;
int r = 0;
long long sum = w[0];
vector<int > ans;
while(r <n){
while(sum >u){
sum-=w[l];
l++;
}
if(sum >= l){
for(int i = l; i<=r; i++){
ans.push_back(w[i]);
}
break;
}
}
if(!ans.size()){
ans.push_back(0);
}
return ans;
}