Submission #1049978

#TimeUsernameProblemLanguageResultExecution timeMemory
1049978Huseyn123Carnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms860 KiB
#include <bits/stdc++.h> 
#include "tickets.h"
#include <vector>
#define pb push_back
using namespace std; 
typedef long long ll; 
ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer;
	ll res=0;
	if(m==1){
		vector<int> a; 
		for(int i=0;i<n;i++){
			a.pb(x[i][0]);
		}
		sort(a.begin(),a.end());
		for(int i=0;i<n;i++){
			res+=abs(a[i]-a[n/2]);
		}
		for(int i=0;i<n;i++){
			answer.pb({0});
		}
	}
	allocate_tickets(answer);
	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...