Submission #302715

#	Time	Username	Problem	Language	Result	Execution time	Memory
302715		galca	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	512 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>   

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

	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		tickets[i] = x[i][0];

		for (int j = 0; j < m; j++) {
			row[j] = 1;
		}
		answer.push_back(row);
	}

	std::sort(tickets.begin(), tickets.end());
	long long res = 0;
	for (int i = 0; i < n / 2; i++) {
		res += (tickets[n - i - 1] - tickets[i]);
	}
	allocate_tickets(answer);
	return 1;
}

• Subtask 1: 0 / 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