# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122285 | 2019-06-28T04:00:48 Z | turbat | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "molecules.h" using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector <int> ans; vector <pair <int, int> > v; for (int i = 0;i < w.size();i++) v.push_back({w[i], i}); sort(v.begin(), v.end()); int s = 0, l = 0;; for (int i = 0;i < v.size();i++){ if (s + v[i].first <= u) s += v[i].first; else { if (s >= l) { for (int j = l;j <= i;j++) ans.push_back(v[j].second); break; } s += v[i].first; s -= v[l].first; } } // cout << l << ' ' << u << endl; // for (int x : ans) // cout << x<< ' '; // cout << endl; sort(ans.begin(), ans.end()); return ans; }