Submission #828467

#TimeUsernameProblemLanguageResultExecution timeMemory
828467Minindu206Carnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms300 KiB
#include "tickets.h" #include <vector> #include<bits/stdc++.h> #define ll long long #define vi vector<int> #define vvi vector<vi> using namespace std; ll find_maximum(int k, vvi x) { int n = x.size(), m = x[0].size(); vi arr(n); for(int i=0;i<n;i++) arr.push_back(x[i][0]); sort(arr.begin(), arr.end()); ll ans = 0; for(int i=0;i<n/2;i++) ans -= arr[i]; for(int i=n/2;i<n;i++) ans += arr[i]; vvi al(n, vi(m, 0)); allocate_tickets(al); return ans; }
#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...