# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303572 | medmdg | 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>
#include "tickets.h"
using namespace std;
long long int find_maximum(int k, vector<vector<int> > x){
int n=x.size();
int m=x[0].size();
if(m==1){
vector<vector<int> > ans(n);
for(int i=0;i<n;i++){
ans[i].push_back(x[i][0]);
return allocate_tickets(ans);
}
}
}