#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
template<typename T>
using vec = vector<T>;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
allocate_tickets(vec<vec<int>>(n, vec<int>(m, 0)));
int S = 0;
vec<int> t(n, 0);
for (int i = 0; i < n; i++) {
t[i] = x[i][0];
}
sort(t.begin(), t.end());
for (int i = 0; i < n; i++) {
if (i < n / 2) S -= t[i];
else S += t[i];
}
return S;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |