1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=110; int g[N][N],a[N]; int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>g[i][j]; } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { a[j]=g[i][j]; } sort(a+1,a+m+1); for(int j=1;j<=m;j++) { g[i][j]=a[j]; } } for(int j=1;j<=m;j++) { for(int i=1;i<=n;i++) { a[i]=g[i][j]; } sort(a+1,a+n+1); for(int i=1;i<=n;i++) { g[i][j]=a[i]; } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cout<<g[i][j]<<" "; } cout<<endl; } return 0; }
Information
- ID
- 3593
- Time
- 1000ms
- Memory
- 512MiB
- Difficulty
- 10
- Tags
- # Submissions
- 2
- Accepted
- 2
- Uploaded By