# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1226568 | HappyCapybara | Carnival Tickets (IOI20_tickets) | C++17 | 0 ms | 328 KiB |
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll find_maximum(int k, vector<vector<int>> x){
int n = x.size();
int m = x[0].size();
if (k == m){
vector<int> at;
for (int i=0; i<n; i++){
for (int j=0; j<m; j++) at.push_back(x[i][j]);
}
sort(at.begin(), at.end());
ll res = 0;
for (int i=0; i<k*n/2; i++) res -= at[i];
for (int i=k*n/2; i<k*n; i++) res += at[i];
return res;
}
}
Compilation message (stderr)
# | 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... |