# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362142 | Sorting | Carnival Tickets (IOI20_tickets) | C++17 | 868 ms | 85156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1500 + 3;
vector<vector<int>> x, answer;
int n, m, k, idx[N];
array<int, 2> arr[N];
void clear(){
}
ll solve(){
clear();
ll ans = 0;
priority_queue<array<int, 2>> pq;
int add = n * k / 2;
for(int i = 0; i < n; ++i){
idx[i] = 0;
pq.push({-x[i][0] - x[i][m - k], i});
}
while(add--){
auto [score, i] = pq.top();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |