| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1039648 | amirhoseinfar1385 | 카니발 티켓 (IOI20_tickets) | C++17 | 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 "tickets.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1500+10;
long long n,m,all[maxn][maxn];
vector<vector<long long>>res;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
n = x.size();
m = x[0].size();
res.resize(n,vector<long long>(m));
vector<long long>suma;
vector<pair<long long,pair<long long ,long long>>>allb;
for(long long i=0;i<n;i++){
for(long long j=0;j<m;j++){
all[i][j]=x[i][j];
res[i][j]=-1;
suma.push_back(all[i][j]);
}
allb.push_back(make_pair(all[i][0],make_pair(all[i][m-1],i)));
}
sort(allb.begin(),allb.end());
long long mainres=0;
for(long long i=0;i<n;i++){
// cout<<i<<" "<<n/2<<" "<<suma[i]<<endl;
if(i<n/2){
mainres-=allb[i].first;
res[allb[i].second.second][0]=0;
}else{
mainres+=allb[i].second.first;
res[allb[i].second.second][m-1]=0;
}
}
allocate_tickets(res);
return mainres;
}