1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <bits/stdc++.h>

#define int long long
const int inf = (int)1e18 + 9;
const int MAX = 3e5 + 5;
int dp1[MAX];
int dp2[MAX];
void solve()
{
  int n, m, k;
  std::cin >> n >> m >> k;
  std::vector<std::vector<int>> a(n + 1, std::vector<int>(m + 1, 0));
  std::vector<std::vector<int>> suf(n + 1, std::vector<int>(m + 1, 0));
  std::vector<int> sorted, rev_sorted;
  for (int i = 0; i <= k; i++)
    dp1[i] = dp2[i] = -inf;
  dp1[0] = 0, dp2[0] = 0;

  for (int i = 1; i <= n; i++)
  {
    for (int j = 1; j <= m; j++)
    {
      std::cin >> a[i][j];
    }
    bool is_sorted = true;
    for (int j = 1; j <= m - 1; j++)
    {
      if (a[i][j] > a[i][j + 1])
        is_sorted = false;
    }
    int sum = 0;
    for (int j = m; j >= 1; j--)
    {
      sum += a[i][j];
      suf[i][j] = sum;
    }

    if (is_sorted)
      sorted.push_back(i);
    else
    {
      std::sort(a[i].begin(), a[i].end());
      rev_sorted.push_back(i);
    }
  }

  std::priority_queue<std::pair<int, int>> q;
  for (auto it : rev_sorted)
  {

    q.push({a[it].back(), it});
  }
  int sum = 0;
  for (int i = 1; i <= rev_sorted.size() * m; i++)
  {
    assert(q.size() > 0);
    sum += q.top().first;
    int id = q.top().second;
    a[id].pop_back();
    q.pop();
    if (a[id].size() > 0)
    {
      q.push({a[id].back(), id});
    }
    dp1[i] = sum;
  }
  // return;
  for (int rem = 0; rem < m; rem++)
  {
    std::vector<int> ids = sorted;
    std::multiset<int> xd;
    for (auto it : ids)
    {
      xd.insert(suf[it][1] - suf[it][rem + 1]);
    }
    std::sort(ids.begin(), ids.end(),
              [&](int i, int j)
              { return suf[i][rem + 1] > suf[j][rem + 1]; });

    if (!xd.empty())
      dp2[rem] = *xd.rbegin();
    sum = 0;
    // continue;
    for (int i = 1; i <= ids.size(); i++)
    {
      auto last_id = ids[i - 1];
      sum += suf[last_id][1];
      // continue;
      int act_id = i * m + rem;
      xd.erase(xd.find(suf[last_id][1] - suf[last_id][rem + 1]));
      // std::cout << "TERAZ " << i * m + rem << " " << i << " " << rem << "\n";
      if (act_id > k)
        continue;
      dp2[act_id] = sum + (xd.empty() ? 0 : *xd.rbegin());
    }
  }

  int ans = 0;

  for (int i = 0; i <= k; i++)
  {
    // std::cout << "TERAZ " << i << " " << dp1[i] << " " << dp2[i] << "\n";
    ans = std::max(ans, dp1[i] + dp2[k - i]);
  }

  // for (int i = 0; i <= rev_sorted.size() * m; i++) {
  //     std::cout << dp1[i] << " ";
  //     std::cout << "\n";
  // }

  std::cout << ans << "\n";
}

int32_t main()
{
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  std::cout.tie(0);
  int testcases = 1;
  // std::cin >> testcases;
  while (testcases--)
  {
    solve();
  }
  return 0;
}