Submission #1163831

#TimeUsernameProblemLanguageResultExecution timeMemory
1163831AlgorithmWarriorCarnival Tickets (IOI20_tickets)C++20
11 / 100
1 ms836 KiB
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

long long find_maximum(int k,vector<vector<int>>x){
	int n = x.size();
	int m = x[0].size();
    vector<int>v;
    int i;
    for(i=0;i<n;++i)
        v.push_back(x[i][0]);
    sort(v.begin(),v.end());
    int mij=(n-1)/2;
    long long sum=0;
    for(i=0;i<n;++i)
        sum+=abs(v[mij]-v[i]);
	vector<vector<int>>answer;
    for(i=0;i<n;++i){
        vector<int>row;
        row.push_back(0);
        answer.push_back(row);
    }
	allocate_tickets(answer);
	return sum;
}
#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...