求调

#include<iostream>
#include<algorithm>
#define int long long
int n, f, t, a[110], sort[110], sum, fr_sum[110], ans = 1e15, dp[110][110][10010];
signed main()
{
	std::cin >> n >> f >> t;
	for (int i = 1; i <= n; i++)
	{
		std::cin >> a[i];
		fr_sum[i] = fr_sum[i - 1] + a[i];
		sort[i] = a[i];
	}
	std::sort(sort + 1, sort + 1 + n);
	for (int i = 0 ; i < f; i++)
	{
		sum += sort[n - i];
	}
	if (sum < t)
	{
		std::cout << "NO";
		return 0;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= f; j++)
		{
			dp[i][j][0] = fr_sum[j];
			if (dp[i][j][0] >= t)
			{
				ans = 0;
			}
			for (int k = 1; k <= n * (n + 1) / 2; k++)
			{
				dp[i][j][k] = std::max(dp[i][j][k], dp[i - 1][j][k]);
				for (int p = 1; p < j; p++)
				{
					if (k - i + p < 0)
					{
						continue;
					}
					if (dp[i - 1][j - 1][k - i + p] + a[i] > dp[i][j][k])
					{
						dp[i][j][k] = dp[i - 1][j - 1][k - i + p] + a[i];
					}
				}
				if (dp[i][j][k] >= t)
				{
					ans = std::min(ans, k);
				}
			}
		}
	}
	std::cout << ans;
	return 0;
}