#include #include #include using namespace std;

int main() { int M, N; cin >> M >> N; int heights[30][30]; int max_heights[30]; int average_heights[30]; int count = 0; int above_165[30];

// 输入队员身高
for (int i = 0; i < M; i++) {
    for (int j = 0; j < N; j++) {
        cin >> heights[i][j];
    }
}

// 挑选每行最高身高
for (int i = 0; i < M; i++) {
    int max_height = heights[i][0];
    for (int j = 1; j < N; j++) {
        max_height = max(max_height, heights[i][j]);
    }
    max_heights[i] = max_height;
}

// 求每行平均身高
for (int i = 0; i < M; i++) {
    int sum_height = 0;
    for (int j = 0; j < N; j++) {
        sum_height += heights[i][j];
    }
    average_heights[i] = round(sum_height / (double)N);
}

// 挑选身高大于165的队员
for (int i = 0; i < M; i++) {
    for (int j = 0; j < N; j++) {
        if (heights[i][j] > 165) {
            above_165[count++] = heights[i][j];
        }
    }
}

// 输出每行最高身高
for (int i = 0; i < M; i++) {
    cout << max_heights[i] << endl;
}

// 输出每行平均身高
for (int i = 0; i < M; i++) {
    cout << average_heights[i] << endl;
}

// 排序并输出身高大于165的队员
sort(above_165, above_165 + count, greater<int>());
for (int i = 0; i < count; i++) {
    cout << above_165[i] << " ";
}

return 0;

原文地址: https://www.cveoy.top/t/topic/hVYP 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录