购物

题目地址：

https://ac.nowcoder.com/acm/problem/14526

基本思路：

参考代码：

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IO std::ios::sync_with_stdio(false); cin.tie(0)
#define int long long
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#define pb push_back
#define pii pair <int, int>
#define mp(a, b) make_pair(a, b)
#define INF (int)1e18

inline int read() {
  int x = 0, neg = 1; char op = getchar();
  while (!isdigit(op)) { if (op == '-') neg = -1; op = getchar(); }
  while (isdigit(op)) { x = 10 * x + op - '0'; op = getchar(); }
  return neg * x;
}
inline void print(int x) {
  if (x < 0) { putchar('-'); x = -x; }
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}

const int maxn = 310;
int n,m,a[maxn][maxn],sum[maxn][maxn],dp[maxn][maxn];
signed main() {
  IO;
  cin >> n >> m;
  rep(i, 1, n) {
    rep(j, 1, m) cin >> a[i][j];
    sort(a[i] + 1, a[i] + 1 + m);
  }
  rep(i, 1, n) {
    sum[i][0] = 0;
    rep(j, 1, m) sum[i][j] = sum[i][j - 1] + a[i][j];
  }
  mset(dp, 0x3f);
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= min(i * m, n); j++) {
      for (int k = max(i - 1, j - m); k <= min((i - 1) * m, j); k++) {
        dp[i][j] = min(dp[i][j], dp[i - 1][k] + sum[i][j - k] + (j - k) * (j - k));
      }
    }
  }
  cout << dp[n][n] << '\n';
  return 0;
}