Submission #1444836

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <sstream> //string stream its useful!
#include<string>
#include<iostream>
#include<utility> //pair
#include <vector> // vector
#include <algorithm>    // swap,sort,binary_search
#include <functional>   // std::greater
#include <map> //map
#include<set> //set
#include<queue> //queue
#include<list> //list
#include<cmath>
#include<numeric>
#include<cassert>
#include <iomanip> //cout<<setprecision
#include <regex>
#include <ctype.h> //toupper case

typedef long long ll;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
ll W = 1000000007;


using namespace std;
void omajinai() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(15);
}

class Main{
public:
    pair<int,int> DJ[7];
    Main(){
        REP(i,7) cin>>DJ[i].first;
        REP(i,7) cin>>DJ[i].second;
    }
    void run(){
        const long ans = accumulate(DJ,
                                    DJ+7,
                                    0L,
                                    [](long sum , pair<int,int> p){
                                        return sum + max(p.first,p.second);
                                    }
                                    );
        cout<<ans<<endl;
        
    }
};

#ifndef gtest
int main(){
    omajinai();
    Main().run();
    return 0;
}
#endif

Submission Info

Judge Result