# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300759 | BaraaArmoush | Carnival Tickets (IOI20_tickets) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int,int> pii;
ll find_maximum(int k, vector <vector <int>> a)
{
int n = a.size();
int m = a[0].size();
vector <vector <pii>> b(n, vector <pii> (m));
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
b[i][j] = pii(a[i][j], j);
for(int i = 0; i < n; i++)
sort(b[i].begin(), b[i].end());
vector <int> PrefixTaken(n, k);
vector <int> SuffixTaken(n, 0);
ll Ans = 0;
for(int i = 0; i < n; i++)
for(int j = 0; j < k; j++)
Ans -= b[i][j].first;
priority_queue <pair <int,pii>> q;
for(int i = 0; i < n; i++)