# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491952 | lorenzoferrari | 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
int find_subset(int l, int u, int w[], int n, int r[]) {
multiset<ll> m;
for (int i = 0; i < n; ++i)
m.insert(w[i]);
if (*m.begin() > u)
return 0;
ll sum = 0;
multiset<ll> ans;
while (!m.empty() && sum < l) {
auto it = m.end(); --it;
sum += *it;
ans.insert(*it);
m.erase(it);
}
if (sum < l) return 0;
while (sum > u) {
auto a = m.begin();
auto b = ans.end(); --b;
ll aa = *a;
ll bb = *b;
m.erase(a);
ans.erase(b);
sum += aa - bb;
m.insert(bb);
ans.insert(aa);
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
auto it = ans.find(w[i]);
if (it != ans.end()) {
ans.erase(it);
r[cnt++] = i;
}
}
return cnt;
}