Codeforces Round #610 (Div. 2)

DP

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+100;
int a[N],n,m,k;
int res[N];
int f[N];
int t;
int main()
{
	 ios::sync_with_stdio(false);
//	 freopen("data.in","r",stdin);                  //从文件data.in中读入数据
  //   freopen("AC.out","w",stdout);    //输出的结果存在ZhengJie.out文件中
	cin>>t;
	while(t--)
	{
		cin>>n>>m>>k;
		for(int i=1;i<=n;i++) cin>>a[i];
		sort(a+1,a+1+n);
		for(int i=1;i<=n;i++) res[i]=res[i-1]+a[i];
		for(int i=k;i<=n;i++) res[i]=res[i-k]+a[i];
		int p;
		for(int i=0;i<=n;i++) if(m>=res[i])  p=i;
		cout<<p<<endl;
	}
}

本文地址：https://blog.csdn.net/csdn_ggboy/article/details/107197844