제출 #395508

#제출 시각아이디문제언어결과실행 시간메모리
395508snasibov05Carnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms204 KiB
#include "tickets.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

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

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

    int res = 0;
    sort(v.begin(), v.end());
    for (int i = 0; i < n; ++i) {
        if (i < n / 2) res -= v[i];
        else res += v[i];
    }

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