#include "tickets.h" #include<bits/stdc++.h> using namespace std; #define mp make_pair #define INF 10000000 #define MOD 1000000007 #define MID ((l+r)/2) #define HASHMOD 2305843009213693951 #define ll long long #define ull unsigned long long #define F first #define S second typedef pair<ll, ll> ii; typedef pair<ii, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef map<int, int> mii; #define EPS 1e-6 #define FOR(i,n) for(int i=0;i<((int)(n));i++) #define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++) #define FOA(v, a) for(auto v : a) long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); vector<vi> answer(n); FOR(i,n) answer[i].push_back({0}); vi all; FOA(v,x){ all.push_back(v[0]); } sort(all.begin(), all.end()); ll ans=0; FOA(v,all) ans+=abs(v - all[n/2]); allocate_tickets(answer); return ans; }