Submission #1245296

#TimeUsernameProblemLanguageResultExecution timeMemory
1245296qwushaCarnival Tickets (IOI20_tickets)C++20
0 / 100
1 ms328 KiB

#include "tickets.h"

#include <iostream>
#include <bits/stdc++.h>

#define fi first
#define se second
typedef long long ll;
using namespace std;

int inf = 1e9 + 7;


ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = x[i][0];
    }
    sort(a.begin(), a.end());
    int mid = a[n / 2];
    int res = 0;
    for (auto el : a) {
        res += abs(el - mid);
    }
    vector<vector<int>> s(n, vector<int>(1));
    for (int i = 0; i < n; i++) {
        s[i][0] = 0;
    }
    allocate_tickets(s);
    return res;

}
#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...