제출 #434216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434216		ioi	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	2 ms	588 KiB

tickets

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

long long find_maximum(int k, std::vector<std::vector<int>> x) {


	int n = x.size() , m = x[0].size();


	vector<vector<int> > ans(n , vector<int> (m , 0));
	allocate_tickets(ans);
    double b = 0 ;
    vector<int> v;

    for(int i = 0 ; i < n ; i ++)
       v.push_back(x[i][0]);

    sort(v.begin() , v.end());


    b = v[n / 2];

    long long ret = 0 , mn ;

    for(int i = 0 ; i < n ; i++)ret += abs(x[i][0] - b);
    mn = ret ;

    b = v[n / 2 - 1];

    ret = 0 ;

    for(int i = 0 ; i < n ; i ++)ret += abs(x[i][0] - b);

    return min(mn , ret);



    return ret ;



	/*
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return 1;

	*/
}

• 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