CCP-CSP认证考试 201909-1 小明种苹果 c/c++题解

题目描述

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <deque>
#include <list>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <iterator>
using namespace std;

typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll  INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double E = exp(1.0);
const int MOD = 1e9+7;
const int MAX = 1e3+5;
int n,m;
int a[MAX];

int main()
{
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    */

    while(cin >> n >> m)
    {
        int maxNum,maxId; maxNum = 0;// 最多疏果个数及其编号
        int sum = 0;// 最后剩下的苹果个数
        int tmp1;
        for(int i = 1; i <= n; i++)
        {
            cin >> tmp1;
            sum += tmp1;
            int tmp2;
            int tmpMax = 0;
            for(int j = 1; j <= m; j++)
            {
                cin >> tmp2;
                tmpMax += abs(tmp2);
            }
            sum -= tmpMax;
            if(tmpMax > maxNum)
            {
                maxNum = tmpMax; maxId = i;
            }
        }
        cout << sum << " " << maxId << " " << maxNum << endl;
    }

    return 0;
}