Submission #380779

#TimeUsernameProblemLanguageResultExecution timeMemory
380779Pichon5Carnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms748 KiB
#include "tickets.h"
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
using namespace std;
long long find_maximum(int k,vector<vi> x) {
	int n = x.size();
	int m = x[0].size();
	ll res=0;
	vi v;
	vector<vi>M(n,vi(m));
	for(int i=0;i<n;i++){
        v.pb(x[i][0]);
	}
	sort(v.begin(),v.end());
	for(int i=0;i<n;i++){
        M[i][0]=0;
        if(i<n/2){
            res-=v[i];
        }else{
            res+=v[i];
        }
	}
	allocate_tickets(M);
	return res;
}
#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...