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 <vector>
#include <algorithm>
using namespace std;
vector < int > all;
long long find_maximum(int k,vector< vector<int> > x)
{
int n=x.size();
int m=x[0].size();
int i;
long long ans=0;
vector < vector<int> > answer;
for (int i=0;i<n;i++)
{
vector<int> row(m);
row[0]=0;
all.push_back(x[i][0]);
answer.push_back(row);
}
sort(all.begin(),all.end());
for(i=0;i<n;i++) ans+=abs(all[i]-all[n/2]);
allocate_tickets(answer);
return ans;
}
| # | 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... |