STAMPS prob help required

[gallardo]

i have tried to come up with this code. it's workin for all sample test cases and for extreme conditions also . But i'm getting WA
someone help

#include<stdio.h>
int main()
{
    int t,stamps,fr[1000],sum,num,temp,i;
    scanf("%d",&t);
    int count=1;
    while(count<=t)
    {
        sum=0;
        scanf("%d",&stamps);
        scanf("%d",&num);
        for(i=0;i<num;i++)
        {
            scanf("%d",&fr[i]);
            sum+=fr[i];
        }
        if(sum<stamps)
    {
        printf("Scenario #%d:\nimpossible\n",count);
    }
    else if(sum==stamps)
    {
        printf("Scenario #%d:\n%d\n",count,num);
    }

    else
    {
        sum=0;
        int m,b=0;
        for(m=num;m>=0;m--)
        {
            for(i=0;i<=m-1;i++)
            {
                if(fr[i]>fr[i+1])
                {
                    temp=fr[i+1];
                    fr[i+1]=fr[i];
                    fr[i]=temp;
                }
            }
            b++;
       // printf("%d\n",fr[num-b]);
            sum+=fr[num-b];
            if(sum>=stamps)
            {
                printf("Scenario #%d:\n",count);
                printf("%d\n",b);
                break;
            }
        }
    }
    printf("\n");
    count++;
}
return 0;
}

[leppyr64]

Are you sure you've got the right values in fr?

Take a look and see if they're right. Check at a few different places.

[gallardo]

Got AC .
Bubble sort didn't work.
insertion sort worked
@leppy:thanks for the help.

[leppyr64]

Bubble sort would have worked just fine if you had stayed within your bounds.

[ericdesouza]

That's good Galiardo..In insertion sort, We have to move the elements to make room, and I understand that you have implemented and it worked.