Solution C++

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 50, M = 210;
int m, n, t;
int w[N], v[N], p[N], f[M];

int main() {
	cin >> m >> n >> t;
	for (int i = 1; i <= n; i ++) cin >> w[i] >> v[i] >> p[i];
	
	for (int i = 1; i <= t; i ++) {
		for (int j = m; j >= 0; j --) {
			for (int k = 1; k <= n; k ++) {
				if (p[k] == i && w[k] <= j) {
					f[j] = max(f[j], f[j-w[k]] + v[k]);
				}
			}
		}
	}

	cout << f[m];
	
	return 0;
}