# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319583 | 2020-11-05T15:29:38 Z | knon0501 | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include "molecules.h" #include <bits/stdc++.h> using namespace std; std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<int> ans; vector<pair<int,int>> a; for(int i=0 ; i<w.size() ; i++)a.push_back({w[i],i}); sort(a.begin(),a.end()); int idx=0; for(auto k: w){ if(k>=l && k<=u){ ans={idx}; return ans; } idx++; } long long s=0; for(int i=(int)w.size()-1 ; i>= 0; i--){ int k=a[i].first; if(k<l){ s+=k; ans.push_back(a[i].second); } if(s>=l && s<=r){ sort(ans.begin(),ans.end()); return ans; } } return {}; }