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>
#include "molecules.h"
#define fi first
#define se second
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
sort(w.begin(),w.end());
int s=0;
int n=w.size(),i;
vector<int> res;
for(i=n-1;i>=0 && s<l;i--)
s+=w[i];
if(s<l || u<s)
return res;
for(i++;i<n;i++)
res.push_back(w[i]);
return res;
}
# | 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... |