Codeforces Round #FF/#255 D DZY Loves Modification --贪心+优先队列

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#define lll __int64
using namespace std;
#define N 1007
#define M 33

lll dp1[N*N],dp2[N*N];
lll RS[N],CS[N];
lll a[N][N];
priority_queue<lll> que;

int main()
{
    int n,m,k,p;
    int i,j;
    while(scanf("%d%d%d%d",&n,&m,&k,&p)!=EOF)
    {
        memset(RS,0,sizeof(RS));
        memset(CS,0,sizeof(CS));
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                scanf("%I64d",&a[i][j]);
                RS[i] += a[i][j];
                CS[j] += a[i][j];
            }
        }
        dp1[0] = dp2[0] = 0;
        while(!que.empty())
            que.pop();
        for(i=1;i<=n;i++)
            que.push(RS[i]);
        for(i=1;i<=k;i++)
        {
            lll tmp = que.top();
            que.pop();
            dp1[i] = dp1[i-1]+tmp;
            tmp -= (lll)m*p;
            que.push(tmp);
        }
        while(!que.empty())
            que.pop();
        for(i=1;i<=m;i++)
            que.push(CS[i]);
        for(i=1;i<=k;i++)
        {
            lll tmp = que.top();
            que.pop();
            dp2[i] = dp2[i-1]+tmp;
            tmp -= (lll)n*p;
            que.push(tmp);
        }
        ll res = dp1[0]+dp2[k];
        for(i=1;i<=k;i++)
        {
            ll tmp = dp1[i]+dp2[k-i]-1LL*i*(k-i)*p;
            res = max(res,tmp);
        }
        printf("%I64d\n",res);
    }
    return 0;
}