제출 #577965

#제출 시각아이디문제언어결과실행 시간메모리
577965VanillaCarnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms724 KiB
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	long long n = x.size();
	long long m = x[0].size();
	vector<vector<int>> answer (n, vector <int> (m));
	long long rs = 0;
	vector <int> v;
	for (int i = 0; i < n; i++){
		v.push_back(x[i][0]);
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++){
		rs+=abs(x[i][0] - v[n / 2]);
	}
	allocate_tickets(answer);
	return rs;
	// return min({rs1, rs2, rs3});
}
#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...