제출 #1353554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1353554		nikulid	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	0 ms	344 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

#define ll long long

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n, vector<int>(m));
  vector<int> ns(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
      answer[i][j] = 0;
      ns[i] = x[i][0];
		}
	}
  allocate_tickets(answer);
  sort(ns.begin(), ns.end());
  return ns[n/2];
}

• 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