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(n);
for (int i = 0; i < n; i++) nums[i] = {w[i], i};
sort(nums.begin(), nums.end());
long long sum = 0;
int r = 0;
for (int i = 0; i < n; i++)
{
while (sum < l)
{
sum += nums[r].first;
r++;
}
if (sum <= u)
{
vector<int> ans;
for (int j = i; j < min(r, n); j++)
{
ans.push_back(nums[j].second);
}
return ans;
}
sum -= nums[i].first;
}
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... |