Submission #1291806

#TimeUsernameProblemLanguageResultExecution timeMemory
1291806lucasdmyCarnival Tickets (IOI20_tickets)C++20
0 / 100
1 ms344 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
/*void allocate_tickets(vector<vector<int>>x){
    for(int k=0;k<x.size();k++){
        for(int i=0;i<x[0].size();i++){
            cout<<x[k][i]<<' ';
        }
        cout<<endl;
    }
}*/
long long find_maximum(int q, vector<vector<int>>x) {
	int n=x.size();
	int m=x[0].size();
	vector<vector<int>>answer;
    sort(x.begin(), x.end());
    int r=0;
	for(int k=0;k<n;k++){
        r+=abs(x[k][0]-x[n/2][0]);
        answer.push_back({1});
    }
	allocate_tickets(answer);
	return r;
}
/*int main(){
    int n;
    cin>>n;
    vector<vector<int>>v;
    for(int k=0;k<n;k++){
        int a;
        cin>>a;
        v.push_back({a});
    }
    cout<<find_maximum(1, v);
}*/
#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...