This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1500+10;
int n,m,all[maxn][maxn];
vector<vector<int>>res;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
n = x.size();
m = x[0].size();
res.resize(n,vector<int>(m));
vector<long long>suma;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
all[i][j]=x[i][j];
res[i][j]=0;
suma.push_back(all[i][j]);
}
}
sort(suma.begin(),suma.end());
long long mainres=0;
for(int i=0;i<n;i++){
// cout<<i<<" "<<n/2<<" "<<suma[i]<<endl;
if(i<n/2){
mainres-=suma[i];
}else{
mainres+=suma[i];
}
}
allocate_tickets(res);
return mainres;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |