WA on #5

#include<bits/stdc++.h>
using namespace std;

const int N = 1e2 + 5;
long long a[N][N], dp[N][N][(N * N) >> 1]; 

int main(){
	memset(dp, -0x3f, sizeof(dp));
	int n, m;
	long long ans = -unsigned(-1);
	cin >> n >> m;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= i; ++j)
			cin >> a[i][j];
	dp[1][1][0] = a[1][1];
	dp[1][1][1] = a[1][1] * 3;
	for(int i = 2; i <= n; ++i){
		for(int j = 1; j <= i; ++j){
			for(int k = 0; k <= min(i, m); ++k){
				dp[i][j][k] = max({dp[i][j][k], dp[i - 1][j][k] + a[i][j], dp[i - 1][j][k - 1] + a[i][j] * 3, dp[i - 1][j - 1][k] + a[i][j], dp[i - 1][j - 1][k - 1] + a[i][j] * 3});
				if(i == n)
					ans = max(ans, dp[i][j][k]);
			}
		}
	}
	cout << ans;
	return 0;
}