| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353553 | nikulid | Carnival Tickets (IOI20_tickets) | C++20 | 0 ms | 0 KiB |
#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));
ll total=0;
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];
}
