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"
using namespace std;
vector<int> find_subset(int l, int u, std::vector<int> w) {
    sort(w.begin(), w.end());
    int n = w.size();
    int L = 0;
    int R = 0;
    long long sum = 0;
    vector<int> a;
    while(R < n){
    	sum += a[R];
    	while(sum >= 1){
    		for(int i = L; i <= R; i++){
    			a.push_back(w[i]);
    			break;
    		}
    	}
    	R++;
    }
    if(a.size() == 0){
    	a.push_back(0);
    }
    return a;
}
| # | 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... |