Submission #300251

#TimeUsernameProblemLanguageResultExecution timeMemory
300251daniel920712Carnival Tickets (IOI20_tickets)C++14
11 / 100
2 ms768 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...