| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1300355 | Agageldi | Art Exhibition (JOI18_art) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
#include "molecules.h"
// #include "grader.cpp"
using namespace std;
#define f first
#define s second
vector <pair<long long,long long>> v;
vector<int> find_subset(int l, int u, vector<int> w) {
long long inx = 0;
for(auto i : w) {
v.push_back({i, inx});
inx++;
}
sort(v.begin(),v.end());
long long sm = 0;
deque <long long> h = {};
for(auto i : v) {
sm += i.f;
h.push_back(i.s);
while(sm > u){
sm -= w[h[0]];
h.pop_front();
}
if(sm >= l && sm <= u) break;
}
vector <int> ans = {};
if(sm >= l && sm <= u)for(auto i : h) ans.push_back(i);
return ans;
}