#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int N, S, T;
cin >> N >> S >> T;
vector<int> all_tasks;
for (int i = 0; i < N * S; ++i) {
int x;
cin >> x;
all_tasks.push_back(x);
}
map<int, int> freq;
for (int t : all_tasks) freq[t]++;
sort(all_tasks.begin(), all_tasks.end());
vector<vector<int>> time_slots(S);
int index = 0;
for (int task : all_tasks) {
time_slots[index].push_back(task);
index = (index + 1) % S;
}
vector<vector<int>> result(N, vector<int>(S));
for (int j = 0; j < S; ++j) {
for (int i = 0; i < N; ++i) {
result[i][j] = time_slots[j][i];
}
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < S; ++j)
cout << result[i][j] << " ";
cout << "\n";
}
return 0;
}
# | 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... |
# | 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... |