CCF计算机软件能力认证 试题编号： 201909-1 试题名称： 小明种苹果

 

# include <stdio.h>

int apples[1001];
int drops[1001][1001];

int main() {

    int N, M;
    scanf("%d %d", &N, &M);
    for (int i = 0; i < N; ++i) {
        scanf("%d", &apples[i]);
        for (int j = 0; j < M; ++j) {
            scanf("%d", &drops[i][j]);
        }
    }

    int all = 0; //计算最后的苹果总数
    int drop_num = 0; //计算去除的苹果数
    int max_index = 0; //计算最多去除数的树的index
    int max = 0; //计算去除最多的苹果数
    for (int i = 0; i < N; ++i) {
        all += apples[i];
        int num = 0;
        for (int j = 0; j < M; ++j) {
            drop_num += drops[i][j];
            num += drops[i][j];
        }
        if (-num > max) {
            max = -num;
            max_index = i + 1;
        }
    }
    all = all + drop_num;
    printf("%d ", all);
    printf("%d ", max_index);
    printf("%d", max);
    return 0;
}