Submission #300444

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300444	2020-09-17 07:19:45	tqbfjotld	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	1457 ms	72204 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
int numsmall[1505];
long long find_maximum(int k, std::vector<std::vector<int>> X) {
  int n = X.size();
  int m = X[0].size();
  long long ans = 0;
  vector<vector<pair<int,int> > > sorted;
  for (int x = 0; x<n; x++){
        vector<pair<int,int> > stuff;
        for (int y = 0; y<m; y++){
            stuff.push_back({X[x][y],y});
        }
        sort(stuff.begin(),stuff.end());
        sorted.push_back(stuff);
  }
    for (int x = 0; x<n; x++){
        for (int y = m-k; y<m; y++){
            ans += sorted[x][y].first;
        }
    }
    priority_queue<pair<int,int> > pq;
    for (int x = 0; x<n; x++){
        pq.push({-sorted[x][m-k].first-sorted[x][0].first,x});
    }
    for (int x = 0; x<k*n/2; x++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23
• Subtask 7: 10 / 10