Submission #1353554

#TimeUsernameProblemLanguageResultExecution timeMemory
1353554nikulidCarnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms344 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));
  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];
}
#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...