Submission #1238112

#TimeUsernameProblemLanguageResultExecution timeMemory
1238112SalihSahinCarnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms328 KiB
#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];

            answer[i][0] = x[i][0];
        }
        sort(arr.begin(), arr.end());
        for(int i = 0; i < n/2; i++){
            val -= arr[i] * 2;
        }

        allocate_tickets(answer);
        return val;
    }
    else{
        return 0;
    }
}
#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...