제출 #734098

#제출 시각아이디문제언어결과실행 시간메모리
734098ismayil카니발 티켓 (IOI20_tickets)C++17
11 / 100
2 ms724 KiB
#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<int> a;
	ll sum = 0, y;
	for(auto i : x) a.push_back(i[0]);
	sort(a.begin(), a.end());
	y = a[n / 2];
	for(auto i : x) sum += abs(i[0] - y);
	vector<vector<int>> s(n, vector<int>(m, 0));
	allocate_tickets(s);
	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...