제출 #304528

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304528		Leonardo_Paes	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	2 ms	768 KiB

tickets

#include "tickets.h"
#include <vector>
#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;
	vector<int> v(n);
	for(int i=0; i<n; i++){
		vector<int> row(m);
		v[i] = x[i][0];
		for(int j=0; j<m; j++) {
			row[j] = 0;
		}
		answer.push_back(row);
	}
	sort(v.begin(), v.end());
	int val = v[n/2];
	long long ans = 0;
	for(auto x : v) ans += abs(val - x);
	allocate_tickets(answer);
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10