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;
#define pii pair<int, int>
vector<int> find_subset(int l, int u, vector<int> w)
{
int n = w.size();
vector<pii> nums;
for (int i = 0; i < n; i++) nums.push_back({w[i], i});
sort(nums.begin(), nums.end());
int lefts=n, rights=n;
long long sum = 0;
while (sum <= u)
{
lefts--;
sum += nums[lefts].first;
}
while (sum > u)
{
rights--;
sum -= nums[rights].first;
lefts--;
sum += nums[lefts].first;
}
if (sum >= l)
{
vector<int> ans(rights-lefts);
for (int i = lefts; i < rights; i++)
{
ans[i-lefts] = nums[i].second;
}
return ans;
}
else
{
vector<int> ans(0);
return ans;
}
}
# | 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... |