#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, S, T;
cin >> N >> S >> T;
vector<vector<int>> input(N, vector<int>(S));
vector<int> all;
for (int i = 0; i < N; ++i)
for (int j = 0; j < S; ++j) {
cin >> input[i][j];
all.push_back(input[i][j]);
}
sort(all.begin(), all.end());
vector<vector<int>> output(S, vector<int>(N));
int idx = 0;
for (int j = 0; j < S; ++j)
for (int i = 0; i < N; ++i)
output[j][i] = all[idx++];
vector<vector<int>> result(N, vector<int>(S));
for (int i = 0; i < N; ++i)
for (int j = 0; j < S; ++j)
result[i][j] = output[j][i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j < S; ++j)
cout << result[i][j] << " \n"[j == S - 1];
}
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... |