CodeForces - 846B Math Show 两种选择方式

对 k 个子任务的花费排序后

对于给定的时间 m 考虑先完成一整个任务还是先挑着耗时少的完成

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 50 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int n, k, m, sum;
int a[maxn];

int solve(int cnt, int num) {
    int ans1 = 0, ans2 = 0;
    if(cnt > n) return 0;
    if(num >= sum) ans1 = k+1 + solve(cnt+1, num-sum);
    for(int i = 1; i <= k; ++i) {
        int t = min(n-cnt+1, num/a[i]);
        ans2 += t;
        num -= t*a[i];
        if(t < (n-cnt+1) ) break;
    }
    ans1 = max(ans1, ans2);
    return ans1;
}

int main() {
    scanf("%d %d %d", &n, &k, &m);
    for(int i = 1; i <= k; ++i) {
        scanf("%d", &a[i]);
        sum += a[i];
    }
    sort(a+1, a+1+k);
    cout << solve(1, m) << endl;

    return 0;
}