Submission #1301454

#TimeUsernameProblemLanguageResultExecution timeMemory
1301454sanoCarnival Tickets (IOI20_tickets)C++20
11 / 100
1 ms580 KiB
#include "tickets.h"
#include <vector>
#include <algorithm>
#define ll long long
#define For(i, n) for(int i = 0; i < n; i++)

#define vec vector

using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	vec<int> a;
	int n = x.size();
	For(i, n){
		a.push_back(x[i][0]);
	}
	sort(a.begin(), a.end());
	ll sum = 0;
	vec<vec<int>> odp(n, vec<int>(1, 0));
	For(i, n/2){
		sum -= a[i];
		sum += a[i+n/2];
	}
	allocate_tickets(odp);
	return sum;
}
#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...