Submission #431514

#TimeUsernameProblemLanguageResultExecution timeMemory
431514Rouge_HugoCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms204 KiB
#include<bits/stdc++.h> #define ll long long #define fi first #define se second #define pb push_back #include "tickets.h" #include <vector> using namespace std; vector<ll>v; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> answer; for (int i = 0; i < n; i++) { vector<int> row(m); row.pb(0);v.pb(x[i][0]); answer.push_back(row); } allocate_tickets(answer); ll re=0; sort(v.begin(),v.end()); for(int i=0;i<n;i++) { re+=abs(v[i]-v[n/2]); } return re; }
#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...