# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233838 | jam_xd_ | 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 "molecules.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int gg = w[0], funcionaaa = w.size(), sum = gg;
bool afirmo;
vector<int>covid;
vector<pair<int,int> >nada;
for (int i=0;i<funcionaaa;i++){
nada.push_back(pair<int,int>(w[i], i));
}
// sort(nada.begin(), nada.end());
for(int i=0;i<funcionaaa;i++){
if(sum + nada[i].first <= u){
sum = sum + nada[i].first;
covid.push_back(nada[i].second);
}
if(sum >= l{
return covid;//nada
}
}
return covid;
}
//:v ??
//wEy Ya :"v aiuda xd SOLO QUIERO 9 PUNTOS >:V