DZY Loves Modification（优先队列）

原题链接
B. DZY Loves Modification
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
As we know, DZY loves playing games. One day DZY decided to play with a n × m matrix. To be more precise, he decided to modify the matrix with exactly k operations.

Each modification is one of the following:

Pick some row of the matrix and decrease each element of the row by p. This operation brings to DZY the value of pleasure equal to the sum of elements of the row before the decreasing.
Pick some column of the matrix and decrease each element of the column by p. This operation brings to DZY the value of pleasure equal to the sum of elements of the column before the decreasing.
DZY wants to know: what is the largest total value of pleasure he could get after performing exactly k modifications? Please, help him to calculate this value.

Input
The first line contains four space-separated integers n, m, k and p (1 ≤ n, m ≤ 103; 1 ≤ k ≤ 106; 1 ≤ p ≤ 100).

Then n lines follow. Each of them contains m integers representing aij (1 ≤ aij ≤ 103) — the elements of the current row of the matrix.

Output
Output a single integer — the maximum possible total pleasure value DZY could get.

Examples
input
2 2 2 2
1 3
2 4
output
11
input
2 2 5 2
1 3
2 4
output
11
Note
For the first sample test, we can modify: column 2, row 2. After that the matrix becomes:

1 1
0 0

For the second sample test, we can modify: column 2, row 2, row 1, column 1, column 2. After that the matrix becomes:

-3 -3
-2 -2

首先我们设最终选了 行 i 次，则列选了 k-i 次
那么假设我们先全部选行，然后选列，则每次选列时，要-= ip
这样最后是 -= i(k-i)p
也就是所有行对列的影响
那我们先把这个 i(k-i)p 提出来，那么选行和选列就互不影响
就可以分别考虑行和列
对于只取行的情况：
预处理出选0次 1次······k次行的最大值 H[i]
即优先队列跑一次即可
同理对列处理, 得到 L[i] 表示取i次列, 0次行的最大值
然后 ans = max( H[i]+L[k-i] - i(k-i)*p )
注意结果可能是很小的负数,ans = -inf ,inf要足够大
这里有一点，int类型若是想找一个负的最小值，就用-0x3fffffff,但是对long long类型还想找到一个最小值那就要用
-0x3fffffffffffffff

#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a[1010][1010],maxr[1000010],maxc[1000010];//maxr数组中的值表示对行操作i次后所能得到的最大值
priority_queue<ll> r,c;//r队列中的所有元素就是所有列分别的总和
int main(){
        ll n,m,k,p,i,j,res;//这里为了后面运算不出问题就是要全部ll化
        cin >> n >> m >> k >> p;
        ll rsum=0,csum=0;
        for(i=0;i<n;i++){
                for(j=0;j<m;j++){
                        cin >> a[i][j];
                        rsum += a[i][j];
                }
                r.push(rsum);
                rsum=0;
        }
        for(i=0;i<m;i++){
                for(j=0;j<n;j++)
                        csum += a[j][i];
                c.push(csum);
                csum=0;
        }
        for(i=1;i<=k;i++){
               ll t=r.top();
               r.pop();
               maxr[i]=maxr[i-1]+t;
               r.push(t-m*p);
        }
        for(i=1;i<=k;i++){
               ll t=c.top();
               c.pop();
               maxc[i]=maxc[i-1]+t;
               c.push(t-n*p);
        }
        ll maxres=-0x3fffffffffffffff;
        for(i=0;i<=k;i++){
                res = maxr[i] + maxc[k-i] - i*(k-i)*p;
                maxres=max(maxres,res);
        }
        cout << maxres << "\n";
        return 0;
}