孩子快疯了，舅舅

#include <bits/stdc++.h> 
#include <queue>

using namespace std;

int n, m, k;

void slove1(){
	int a[101], dp[101][11], ans = 0;
	memset(a, 0, sizeof(a));
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] += a[i-1];
	}
	
	for (int i = 0; i < 101; i++){
		dp[i][0] = 0;
		for (int j = 1; j < 11; j++){
			dp[i][j] = -0xffffff;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= min(k, i); j++) {
			dp[i][j] = dp[i-1][j];
			for (int l = 0; l < i; l++){
				dp[i][j] = max(dp[l][j-1] + a[i] - a[l], dp[i][j]);
			}
		}
	}
	cout << dp[n][k];
}

void slove2(){
	int a[101][2], ss[101], dp[101][101][11], ans = 0;
	memset(a, 0, sizeof(a));
	memset(ss, 0, sizeof(ss));
	for (int i = 1; i <= n; i++) {
		cin >> a[i][0] >> a[i][1];
		a[i][0] += a[i-1][0];
		a[i][1] += a[i-1][1];
		ss[i] += ss[i-1] + a[i][0] + a[i][1];
	}
	
	for (int i = 0; i < 101; i++){
		for (int j = 0; j < 101; j++){
			dp[i][j][0] = 0;
			for (int kk = 0; kk < 11; kk++){
				dp[i][j][kk] = -0xffffff;
			}
		}
	}
	
	dp[0][0][0] = 0;
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			for (int l = 1; l <= min(i+j, k); l++) {
				dp[i][j][l] = max(max(dp[i-1][j][l], dp[i][j-1][l]), dp[i-1][j-1][l]);
				for (int ll = 0; ll < i; ll++){
					dp[i][j][l] = max(dp[ll][j][l-1] + a[i][0] - a[ll][0], dp[i][j][l]);
				}
				for (int ll = 0; ll < j; ll++){
					dp[i][j][l] = max(dp[i][ll][l-1] + a[j][1] - a[ll][1], dp[i][j][l]);
				}
				if (i != j) continue;
				for (int ll = 0; ll < i; ll++){
					dp[i][j][l] = max(dp[ll][ll][l-1] + ss[i] - ss[ll], dp[i][j][l]);
				}
			}
		}
	}
	for (int i = 0; i <= k; i++) ans = max(dp[n][n][k], ans);
	cout << ans;
}

int main() {
	cin >> n >> m >> k;
	if (m == 1) slove1();
	else slove2();
	return 0;
}