第十七次CCF计算机软件能力认证

1、小明种苹果

ACwing 3277

#include <iostream>
#include <algorithm>
using namespace std;

#define x first
#define y second

typedef pair<int, int> PII;
const int N = 1010;

int n, m;
PII cnt[N];

bool cmp(const PII &a, const PII &b) {
   
    if (a.y == b.y) return a.x < b.x;
    return a.y > b.y;
}

int main() {
   
    cin >> n >> m;
    int sum = 0;
    for (int i = 1; i <= n; i++) {
   
        int s = 0, x = 0, w = 0;
        cin >> s;
        for (int j = 1; j <= m; j++) {
   
            cin >> x; w -= x;
        }
        sum += s - w;
        cnt[i] = {
   i, w};
    }
    sort(cnt + 1, cnt + 1 + n, cmp);
    printf("%d %d %d\n", sum, cnt[1].x, cnt[1].y);
    return 0;
}

2、小明种苹果(续)

ACwing 3278

#include <iostream>
#include <algorithm>
using namespace std;

const int