| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1370134 | c12 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(),w.end());
ll sum = 0;
int i;
for(i = 0;i < w.size() && sum < l;i++){
sum += (ll)w[i];
}
if(sum < l) return vector<int>(0);
int j = 0;
for(;i < w.size();){
if(sum > u) sum -= (ll)w[j],j++;
else if(sum < l) sum += (ll)w[i],i++;
else break;
}
if(sum < l || sum > u || j == i) return vector<int>(0);
vector<int>result;
for(int k = j;k < i;k++){
result.push_back(w[k]);
}
return result;
}
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> result = find_subset(l, u, w);
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
