lightOJ 1227 - Boiled Eggs

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int arr[35];

int main()
{
std::ios::sync_with_stdio(false);
int T,cas=0;
cin >> T;
while (T--)
{
int n,p,q,res=0,cnt=0;
cin >> n >> p >> q;
for (int i=0;i < n;i++)
cin >> arr[i];
sort(arr,arr+n);
for (int i = 0;i < n;i++)
{
res += arr[i];
if(cnt<p&&res<=q)
cnt++;
}
printf ("Case %d: %d\n",++cas,cnt);
}
return 0;
}