#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<int> A;
A.reserve((long long)N * S);
vector<vector<int>> a(N, vector<int>(S));
for(int i = 0; i < N; i++)
for(int j = 0; j < S; j++){
cin >> a[i][j];
A.push_back(a[i][j]);
}
sort(A.begin(), A.end());
// fill minute-by-minute
vector<vector<int>> M(S, vector<int>(N));
int idx = 0;
for(int m = 0; m < S; m++)
for(int c = 0; c < N; c++)
M[m][c] = A[idx++];
// transpose back to core-wise
for(int c = 0; c < N; c++){
for(int m = 0; m < S; m++){
cout << M[m][c] << (m+1==S? '\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... |