# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851118 | hlau | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int n, l, u;
cin >> n >> l >> u;
int ar[n];
for(int i=0; i<n; i++) cin >> ar[i];
pair<int, int> pa[n];
for(int i=0; i<n; i++){
pa[i]={ar[i], i};
}
sort(pa, pa+n);
int sum = 0;
vector <int> ans;
for(int i=0, j=0; j<n; j++) {
sum += pa[j].first;
while(sum>u) {
sum-=pa[i++].first;
}
if(sum>=l) {
for(int k=i; k<=j; k++) {
ans.push_back(pa[k].second);
}
break;
}
}
cout << ans.size() << endl;
for(int i:ans) cout << i << ' ';
}