简单题解：统计分数

定义变量：

#include <bits/stdc++.h>
using namespace std;
 ---------------
|int n, m;      |  
|int a[11][11]; |
 ---------------
int main() {
            
    return 0;
}

输入数据：

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[11][11];
int main() {
 --------------------------------------
|    cin >> n >> m;                    |
|    for(int i = 1; i <= n; i++) {     | 
|        for(int j = 1; j <= m; j++) { |
|            cin >> a[i][j];           |
|        }                             |
|    }                                 |
 --------------------------------------
    return 0;
}

找各科的最高分数和最低分数：

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[11][11];
int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
 --------------------------------------------
|    int maxn[11] = {}, minn[11] = {};       |
|    for(int j = 1; j <= m; j++) {           |
|        minn[j] = a[1][j];                  |
|        for(int i = 1; i <= n; i++) {       |
|            maxn[j] = max(maxn[j], a[i][j]);|
|            minn[j] = min(minn[j], a[i][j]);|
|        }                                   |
|    }                                       |
 --------------------------------------------
    return 0;
}

输出答案：

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[11][11];
int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    int maxn[11] = {}, minn[11] = {};
    for(int j = 1; j <= m; j++) {
        minn[j] = a[1][j];
        for(int i = 1; i <= n; i++) {
            maxn[j] = max(maxn[j], a[i][j]);
            minn[j] = min(minn[j], a[i][j]);
        }
    }
 -----------------------------------------------------------
|    for(int i = 1; i <= m; i++) cout << maxn[i] << " ";    |
|    cout << endl;                                          |
|    for(int i = 1; i <= m; i++) cout << minn[i] << " ";    |
 -----------------------------------------------------------
    return 0;
}

最终代码：

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[11][11];
int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    int maxn[11] = {}, minn[11] = {};
    for(int j = 1; j <= m; j++) {
        minn[j] = a[1][j];
        for(int i = 1; i <= n; i++) {
            maxn[j] = max(maxn[j], a[i][j]);
            minn[j] = min(minn[j], a[i][j]);
        }
    }
    for(int i = 1; i <= m; i++) cout << maxn[i] << " ";
    cout << endl;
    for(int i = 1; i <= m; i++) cout << minn[i] << " ";
    return 0;
}