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;
 
#include "molecules.h"
vector<int> find_subset(int l, int r, vector<int> w) {
	int n = size(w);
	vector<vector<int>> q(n);
	for(int i = 0; i < n; i++)
		q[i] = {w[i], i};
	sort(q.begin(), q.end());
	vector<int> ans;
	long long pref = 0, suff = 0;
	for(int i = 0; i < n; i++) {
		ans.emplace_back(q[i][1]);
		pref += q[i][0];
		suff += q[n - 1 - i][0];
		if(pref <= r && l <= suff) {
			for(int j = 0; pref < l; j++) {
				pref -= q[i - j][0];
				pref += q[n - 1 - j][0];
				ans[i - j] = q[n - 1 - j][1];
			}
			return ans;
		}
	}
	return {};
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |