#include "bits/stdc++.h"
#include "tickets.h"
#define pb push_back
using namespace std;
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, -1));
if(m == 1){
long long val = 0;
vector<int> arr;
for(int i = 0; i < n; i++){
arr.pb(x[i][0]);
val += x[i][0];
}
sort(arr.begin(), arr.end());
for(int i = 0; i < n/2; i++){
val -= arr[i] * 2;
}
return val;
}
else{
return 0;
}
}
# | 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... |