Dance battle[Unfinished].cpp

#include<cstdio>
#include<algorithm>
using namespace std;

int n,energy,rival,I,i;
int R[100000],ans[100000];

int main()
{
    scanf("%d",&n);
    for(I=1;I<=n;I++)
    {
        int honor=0;
        scanf("%d %d",&energy,&rival);
        for(i=0;i<rival;i++)
        {
            scanf("%d",&R[i]);
        }
        sort(R,R+rival);
        for(i=0;i<rival;i++)
        {
            if(energy-R[i]>0)
            {
                energy-=R[i];
                honor++;
            }
            else if(energy-R[i]<=0 && i<rival-1)
            {
                energy+=R[i];
                honor--;
            }
        }
        ans[I]=honor;
    }
    for(I=1;I<=n;I++)
    {
        printf("Case #%d: %d\n",I,ans[I]);
    }
}