hi i am also trying to solve getting WA couldnt find tricky test cases .
please help..for simple test cases it runs fine..
#include<iostream>
//#include<conio.h>
//#include<stdio.h>
using namespace std;
int main()
{
int n,k,s,i,sum=0,p,t,j;
scanf("%d%d%d",&n,&k,&s);
int a[n],b[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
p=k*s;
i=n-1;
while(sum<p&&i>=0)
{
sum+=a[i];
i--;
}
printf("%d\n",n-1-i);
// getch();
return 0;
}