OJ Board

Code: Select all

#include <iostream>
#include <algorithm>

using namespace std;

int main(){
	int t;
	cin >> t;
	for (int tt = 0; tt < t; tt++){
		int n, p, q;
		cin >> n >> p >> q;
		int a[31];
		for (int i = 1; i <= n; i++)
			cin >> a[i];
		sort(a, a + n);
		int mx;
		if (p < q)
			mx = p;
		else
			mx = q;
		int sum = 0;
		for (int i = 1; i <= mx; i++){
			sum += a[i];
			if (sum >= q)
				if (i - 1 < mx)
					mx = i - 1;
		}
		cout << "Case " << tt + 1 << ": " << mx << endl;
	}
}

Code: Select all

/* Removed */

Code: Select all

3
3 2 10
1 2 3
4 5 5
4 4 5 5
1 4 30
1

Code: Select all

Case 1: 2
Case 2: 1
Case 3: 1

Code: Select all

 Got AC 

Code: Select all

4
5 5 100
20 20 20 20 20
10 1 45
1 2 3 4 5 6 7 8 9 9
1 10 60
30 45 60
3 100 29
45 46 47

Code: Select all

Case 1: 5
Case 2: 1
Case 3: 1
Case 4: 0

Code: Select all

#include <stdio.h>
int main()
{
    int test,c,k,sum,n,p,l,q,i,w[100],j,t;
    scanf(" %d",&test);
   for(l=1;l<=test;l++)
    {
        c=0;
        sum=0;
        scanf("%d %d %d",&n,&p,&q);
        for(i=0;i<n;i++)
        {
            scanf("%d",&w[i]);
        }
        for(k=0;k<p;k++)
        {
            sum=sum+w[k];
            if(sum>q)
            {
                break;
            }
            c++;
        }
        printf("Case %d: %d\n",l,c);
    }
    return 0;
}