2973. 卡片游戏

#include <bits/stdc++.h>

using namespace std;


int main()
{
    int T;
    scanf("%d", &T);
    for(int i = 0; i < T; ++i){
        int N, M;
        scanf("%d%d", &N, &M);
        int bag[M+1];
        memset(bag, 0, sizeof(bag));
        bag[0] = 1;
        int item[N];
        for(int j = 0; j < N; ++j){
            scanf("%d", item+j);
        }
        for(int n = 0; n < N; ++n){
            for(int m = M; m >= item[n]; --m){
                if(bag[m-item[n]]){
                    if(!bag[m] && m == item[n])  //初始化
                        bag[m] = 1;
                    else if(!bag[m] || bag[m] > bag[m-item[n]]+1)  //用尽可能少的牌得到更多的分数
                        bag[m] = bag[m-item[n]]+1;
                }
            }
        }
        int m = M;
        while(m > 0){
            if(bag[m] == 3)  //找到用3张牌可以得到的最大分数
                break;
            m--;
        }
        printf("case #%d:\n%d\n", i, m);
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b)
{
    int *p1=(int*)a, *p2=(int*)b;
    return *p2-*p1;
}
int main()
{
    int T, I;
    scanf("%d",&T);
    for(I=0; I<T; I++)
    {
        int n, m, i, j, k, num[100], x, max=0;
        scanf("%d %d",&n,&m);
        for(i=0; i<n; i++) 
        {
            scanf("%d",&num[i]);
            if(num[i]>=m-1) {i--; n--;}
        }
        qsort(num, n, sizeof(int), cmp);//从大到小排序
        for(i=0; i<n-2; i++)
            for(j=i+1; j<n-1; j++)//遍历前两个数
            {
                x=num[i]+num[j];
                if(x>=m) continue;
                else
                {
                    for(k=j+1; k<n; k++)//判断第三个数
                        if(num[k]<=m-x)
                        {
                            if(max<x+num[k]) max=x+num[k];
                            break;
                        }
                }
            }
        printf("case #%d:\n%d\n",I,max);
    }
    return 0;
}

#include <iostream>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
#define Check(a, b) (a >= 0 && a < h && b >= 0 && b < w) 
int T, N, M, sum = 0;
int Arr[100];
void solve();
int main() {
    #ifndef ONLINE_JUDGE
    freopen("a.txt", "r", stdin);
    #endif
    cin >> T;
    for (int i = 0; i < T; i++) {
        cout << "case #" << i << ":\n";
        solve();
    }

}
void solve() {
    cin >> N >> M;
    sum = 0;
    int maxn = 0;

    for (int i = 0; i < N; i++) cin >> Arr[i];
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            for (int k = j + 1; k < N; k++) {
                sum = Arr[i] + Arr[j] + Arr[k];
                if (sum > maxn && sum <= M) maxn = sum;
            }
        }
    }
    cout << maxn << endl;

}