# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856010 | IS_Rushdi | 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 <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
vector<pair<int,int>>a;
for(int i = 0; i < n; i++) a.push_back({w[i],i});
sort(a.begin(), a.end());
priority_queue<int>pq;
long long curr = 0;
for(int i = n-1; i >= 0; i--){
if(curr < l){
curr += a[i].first;
pq.push(i);
}else if(curr > u){
curr-=a[pq.top()].first;
pq.pop();
curr+=a[i].first;
pq.push(i);
}else break;
}
vector<int>ans;
if(curr < l || curr > r){return ans;}
while(!pq.empty()){
ans.push_back(a[pq.top()].second);
pq.pop();
}
return ans;
}
// int main(){
// }