Submission #183406

---

Source Code Expand

#include <iostream>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <complex>

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cfloat>
#include <ctime>

using namespace std;

typedef pair<int,int> point;

typedef signed char int8_t;
typedef unsigned char uint8_t;
typedef signed short int16_t;
typedef unsigned short uint16_t;
typedef signed int int32_t;
typedef unsigned int uint32_t;



int main()
{
    int ret = 0;
    int Ds[7];
    int Js[7];
    
    for(int i = 0; i < 7; ++i) {
        cin >> Ds[i];
    }
    for(int i = 0; i < 7; ++i) {
        cin >> Js[i];
    }
    
    for(int i = 0; i < 7; ++i) {
        ret += max(Ds[i], Js[i]);
    }
    cout << ret << endl;
    
    return 0;
}

Submission Info

Judge Result