Submission #771546

#	Time	Username	Problem	Language	Result	Execution time	Memory
771546		ono_de206	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	1 ms	700 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n, vector<int>(m));
	vector<int> lol;
	for(int i = 0; i < n; i++) {
		lol.pb(x[i][0]);
	}
	sort(all(lol));
	long long ret = 0;
	for(int x : lol) {
		ret += 1LL * abs(x - lol[n / 2]);
	}
	allocate_tickets(answer);
	return ret;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10