Submission #3649374

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
#define mop = 1000000007
using namespace std;


int main() {
   
    vector <int> d,j;
    long long ans = 0;
    for (int i=0;i<7;i++){
        int p;
        cin >> p;
        d.push_back(p);
    }
    for (int i=0;i<7;i++){
        int p;
        cin >> p;
        j.push_back(p);
    }
    for (int i=0;i<7;i++){
        ans += max(d[i],j[i]);
    }

    cout << ans << endl;
}

Submission Info

Judge Result