제출 #1291674

#제출 시각아이디문제언어결과실행 시간메모리
1291674kahoul카니발 티켓 (IOI20_tickets)C++20
11 / 100
4 ms580 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer;

	for (int i = 0; i < n; i++) {
		vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j] = 0;
		}
		answer.push_back(row);
	}

	allocate_tickets(answer);

	long long ans = 1e18;
	for (int i = 0; i < n; i++) {
		long long resp = 0;
		for (int j = 0; j < n; j++) {
			resp += abs(x[i][0] - x[j][0]);
		}
		ans = min(ans, resp);
	}
	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...