43 lines
733 B
C
43 lines
733 B
C
|
#include <stdio.h>
|
||
|
|
|
||
|
|
#define MAX 100
|
||
|
|
|
||
|
|
void findMin(int M[][MAX], int x[], int n, int m);
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
int matrix[MAX][MAX];
|
||
|
|
int x[MAX];
|
||
|
|
int n, m, i, j;
|
||
|
|
|
||
|
|
scanf("%d%d", &n, &m);
|
||
|
|
for (i = 0; i < n; i++) {
|
||
|
|
for (j = 0; j < m; j++) {
|
||
|
|
scanf("%d", &matrix[i][j]);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
findMin(matrix, x, n, m);
|
||
|
|
|
||
|
|
for (i = 0; i < m - 1; i++)
|
||
|
|
printf("%d ", x[i]);
|
||
|
|
printf("%d\n", x[i]);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* 请在这里填写答案 */
|
||
|
|
#pragma gcc optimize("ofast,inline")
|
||
|
|
void findMin(int M[][MAX], int x[], int n, int m) {
|
||
|
|
int min;
|
||
|
|
for (int i = 0; i < m; i++) {
|
||
|
|
min = M[0][i];
|
||
|
|
x[i] = min;
|
||
|
|
for (int j = 0; j < n; j++) {
|
||
|
|
if (M[j][i] < min) {
|
||
|
|
min = M[j][i];
|
||
|
|
x[i] = min;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|