CCF 201909-01（小明种苹果）

 题目信息：首页 - 计算机软件能力认证考试系统

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

typedef struct{
    int x;
    int y;
}point, *pot;

int appleXM(){
    int n, m, i, num = 0, tmp, rev;//棵树 轮数
    //剩余苹果数 max疏果树编号 疏果个数
    point *p;
    scanf("%d %d", &n, &m);
    p = (pot)malloc(n * sizeof(point));
    memset(p, 0, n * sizeof(point));
    tmp = n;
    while(tmp){
        scanf("%d", &(p[n - tmp].x));
        for(i = 0; i < m; i++){
            scanf("%d", &rev);
            p[n - tmp].y += rev;
        }
        num += (p[n - tmp].x + p[n - tmp].y);
        tmp--;
    }
    rev = 0;
    for(i = 1; i < n; i++){
        if(p[i].y < p[rev].y){
            rev = i;
        }
    }
    printf("%d %d %d", num, rev + 1, abs(p[rev].y));
return 0;
}

int main(){
appleXM();
return 0;
}