# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1235266 | yixuan19 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "molecules.h"
#include <iostream>
#include <algorithm>
#include <queue>
#define int long long
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> res;
vector<int> empty;
priority_queue<pair<int,int> > seen;
sort(w.begin(), w.end());
int cnt = 0;
int i = 0;
while (cnt < l && i < w.size()){
cnt+=w[i];
seen.push(make_pair(-w[i],i));
i++;
}
while (cnt > u && !seen.empty()){
cnt -= -(seen.top().first);
seen.pop();
}
if (cnt < l || cnt > u) return empty;
while (!seen.empty()){
res.push_back(seen.top().second);
seen.pop();
}
return res;
}