# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064409 | Rigobertus | 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 <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include "molecules.h"
#define int long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> v;
vector<int> result;
for (int i = 0; i < n; i++) {
v.push_back({ w[i], i + 1 });
}
sort(w.begin(), w.end());
int sum = 0;
for (int i = 0; i < n; i++) {
sum += w[i];
}
for (int i = n - 1; i >= 0; i--) {
if (sum - v[i].first < l) {
result.push_back(v[i].second);
}
else {
sum -= v[i].first;
}
}
if (sum < l) {
return {};
}
return result;
}