제출 #1028934

#제출 시각아이디문제언어결과실행 시간메모리
1028934Amadoo카니발 티켓 (IOI20_tickets)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector <vector <int>> ans(n, vector <int>(m, 0));
	int med = x[n / 2][0];
	long long sum = 0;
	for(int i = 0; i < n; ++i) sum += abs(x[i][0] - med);
	allocate_tickets(ans);
	return sum;
}
#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...