# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1007443 | YesterdayOnceMore | 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>
using namespace std;
typedef long long LL;
const int N=2e5+5;
LL n,l,r,a[N];
LL s[N];
void work(int y,int x)
{
if(y==0)
{
return ;
}
for(int i=x;i<=n;i++)
{
if(s[i+y-1]-s[i]<=r-a[i]&&l-a[i]<=s[n]-s[n-y+1])
{
l-=a[i];r-=a[i];
cout<<i-1<<' ';
work(y-1,i+1);
return ;
}
}
}
int main()
{
cin>>n>>l>>r;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=n;i++)
{
if(s[i]<=r&&l<=s[n]-s[n-i])
{
cout<<i<<endl;
work(i,1);
return 0;
}
}
cout<<0<<endl;
return 0;
}