제출 #779259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779259		jasmin	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	212 KiB

tickets

#include "tickets.h"
#include<vector>
#include<algorithm>
using namespace std;

long long solvem1(int n, int k, vector<vector<int> >& x){

    vector<int> s(n);
    for(int i=0; i<n; i++){
        s[i]=x[i][0];
    }

    sort(s.begin(), s.end());
    int mi=s[n/2];

    long long ans=0;
    for(int i=0; i<n; i++){
        if(s[i]<mi){
            ans += mi-s[i];
        }
        else{
            ans += s[i]-mi;
        }
    }
    return ans;
}

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int> > answer(n, vector<int> (m, 1));
	
	allocate_tickets(answer);
    long long ans=solvem1(n, k, x);
	return ans;
}

• Subtask 1: 0 / 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