Submission #18156

#	Time	Username	Problem	Language	Result	Execution time	Memory
18156		comet	Schools (IZhO13_school)	C++98	5 / 100	2 ms	9132 KiB

school

#include <cstdio>
#include <cstring>
#include <cassert>

using namespace std;
typedef long long ll;

int N,M,S;
ll d[101][101][101];
ll a[101],b[101];

ll max(ll x,ll y){
	return x>y?x:y;
}

ll max(ll x,ll y,ll z){
	return max(x,max(y,z));
}

ll f(int p,int x,int y){
	if(p==N){
		if(x==M&&y==S)return 0;
		return -1e9;
	}
	ll& ret=d[p][x][y];
	if(~ret)return ret;
	ret=f(p+1,x,y);
	if(x<M)ret=max(ret,f(p+1,x+1,y)+a[x]);
	if(y<S)ret=max(ret,f(p+1,x,y+1)+b[y]);
	return ret;
}

int main(){
	scanf("%d%d%d",&N,&M,&S);

	assert(N<=100);
	assert(M<=100);
	assert(S<=100);

	for(int i=0;i<N;i++){
		scanf("%lld%lld\n",&a[i],&b[i]);
	}

	memset(d,-1,sizeof(d));

	printf("%lld\n",f(0,0,0));

	return 0;
}

• Subtask 1: 5 / 100