| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 394140 | Tsvetelina | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 204 KiB | 
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>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
     int  t=w.size();
    vector <int> otg;
    sort (w.begin(), w.end());
    if (w[0]>u) {
        return otg;
    }
    if (w[0]>=l && w[0]<=u) {
        otg.push_back(w[0]);
        return otg;
    }
    otg.push_back(w[0]);
    int sum=w[0];
    for (int i=1; i<t; i++) {
        sum=sum+w[i];
        otg.push_back(w[i]);
        if (sum>=l) {
            return otg;
        }
    }
}
Compilation message (stderr)
| # | 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... | ||||
