Submission #1300052

#TimeUsernameProblemLanguageResultExecution timeMemory
1300052opeleklanosCarnival Tickets (IOI20_tickets)C++20
11 / 100
2 ms580 KiB
#include <iostream>
#include <algorithm>
#include <vector>
#include "tickets.h"
using namespace std;

#define ll long long


ll find_maximum(int k, vector<vector<int>> x){
    ll n = x.size();
    ll m = x[0].size();
    if(m == 1){
        sort(x.begin(), x.end());
        ll ans = 0;
        for(int i = 0; i<n/2; i++) ans -= (ll)x[i][0];
        for(int i = n/2; i<n; i++) ans += (ll)x[i][0];
        vector<vector<int>> arr(n, vector<int>(1, 0));
        allocate_tickets(arr);
        return ans;
    }
    return 1;
}
#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...