[BOJ] 14728 : 벼락치기

#include <stdio.h>
#define max(a,b) (a)>(b)?(a):(b)
int n, t, k, s, d[10001];
int main() {
	scanf("%d %d", &n, &t);
	while (n--) {
		scanf("%d %d", &k, &s);
		for (int i = t; i >= k; i--)
			d[i] = max(d[i], d[i - k] + s);
	}
	printf("%d", d[t]);
	return 0;
}