2012 metu informatikos egzamino antra uzduotis: Kauliukai

//Copyright (C)
//Author: RnD
//Date: 2012-09-23
//Tik viena dalis nepadaryta, jog jei yra daugiau nei 1 maximumas,
//imtu pirmaji is dievu saraso

#include <fstream>
using namespace std;

    ifstream inFile("duom.txt");
    ofstream outFile("rez.txt");
    int n,k;

struct gods{
    string name[50];
    int dice[50][10];
    int total[50];
}god;

void ivedimas();
void skaiciavimas();

int main(){

    ivedimas();
    skaiciavimas();

    inFile.close();
    outFile.close();
    return 0;
}

void ivedimas(){
    inFile >> n >> k;

    for(int i=0;i<n;i++){
        inFile >> god.name[i];
        for(int j=0;j<k;j++){
            inFile >> god.dice[i][j];
        }
    }
}

void skaiciavimas(){
    int max=0,sk;

    for(int i=0;i<n;i++){
        god.total[i]=0;
        for(int j=0;j<k;j++){
            if(god.dice[i][j]%2==0){
                god.total[i] += god.dice[i][j];
            }
            else{
                god.total[i] -= god.dice[i][j];
            }
        }
    }

    for(int g=0;g<n;g++){
        if(max < god.total[g]){
            max = god.total[g];
            sk=g;
        }
    }

    outFile << god.name[sk] << " " << god.total[sk];
}