제출 #321171

#제출 시각아이디문제언어결과실행 시간메모리
321171blue카니발 티켓 (IOI20_tickets)C++17
11 / 100
2 ms748 KiB
#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;

long long find_maximum(int k, vector< vector<int> > x)
{
    int n = x.size();
    vector<int> y(n);
    for(int i = 0; i < n; i++) y[i] = x[i][0];
    sort(y.begin(), y.end());

    int b = y[n/2];
    long long res = 0;
    for(int i = 0; i < n; i++) res += abs(b - y[i]);
    vector< vector<int> > s(n);
    for(int i = 0; i < n; i++) s[i] = vector<int>(1, 0);

    allocate_tickets(s);
    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...