# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983710 | irmuun | Carnival Tickets (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<bits/stdc++.h>
#include "ticket.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
ll find_maximum(int k,vector<vector<int>>x){
auto s=x;
int n=x.size()
int m=x[0].size();
if(m==1){
ll ans=0;
vector<ll>v;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
s[i][j]=0;
v.pb(x[i][j]);
}
}
sort(all(v));
for(int j=n/2;j<n;j++){
ans+=v[j];
}
for(int j=0;j<n/2;j++){
ans-=v[j];
}
return ans;
}
return 0ll;
}