P9457 魔法少女扶苏 (Hard Version)

#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using PII = pair<int,int>;
using ll = long long;
using ull = unsigned long long;



ll row[3010];
ll line[3010];
ll a[3010][3010];
int n,m,k;
int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            scanf("%lld",&a[i][j]);
        }
    }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            row[i] += a[i][j];
        }
        //cout<<row[i]<<" ";
    }
   //cout<<endl;
    for(int i=1;i<=m;i++){
        for(int j=1;j<=n;j++){
            line[i] += a[j][i];
        }
        //cout<<line[i]<<" ";
    }
    //cout<<endl;
    vector<ll> q;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            //cout<<line[j] + row[i] - 2 * a[i][j]<<" ";
            q.push_back(line[j] + row[i] - a[i][j]);
        }
    }
    sort(q.begin(),q.end());
    if(q[k-1] % (n+m-1ll) == 0){
        cout<< q[k-1] / (n+m-1ll) ;
    }else{
        cout<< q[k-1] / (n+m-1ll) + 1ll;
    }





}

溢出整了半天