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 "molecules.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define sz(s) (int)s.size()
#define in insert
#define pb push_back
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
set<pii> st;
int sum=0;
for(int i=0;i<sz(w);i++){
sum+=w[i];
st.in({w[i],i});
if(sum>u){
sum-=st.begin()->F;
st.erase(st.begin());
}
if(l<=sum&&sum<=u){
vector<int> vec;
for(auto x:st)vec.pb(x.S);
return vec;
}
}
return vector<int>();
}
# | 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... |