Submission #183258


Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#endif

using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back


#define MOD 1000000007LL
#define EPS 1e-8



int main(){
	vint v(7), w(7);
	int ans = 0;
	for(int i = 0; i < 7; ++i){
		cin >> v[i];
	}
	for(int i = 0; i < 7; ++i){
		cin >> w[i];
		ans += max(v[i], w[i]);
	}
	cout << ans << endl;
	
}

Submission Info

Submission Time
Task A - ゴールドラッシュ
User climpet
Language C++ (G++ 4.6.4)
Score 100
Code Size 1662 Byte
Status AC
Exec Time 428 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 19
Set Name Test Cases
Sample subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt
All subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Case Name Status Exec Time Memory
subtask0_sample-01.txt AC 428 ms 776 KB
subtask0_sample-02.txt AC 21 ms 932 KB
subtask0_sample-03.txt AC 22 ms 732 KB
subtask0_sample-04.txt AC 21 ms 796 KB
subtask1_01.txt AC 23 ms 764 KB
subtask1_02.txt AC 22 ms 920 KB
subtask1_03.txt AC 23 ms 792 KB
subtask1_04.txt AC 23 ms 772 KB
subtask1_05.txt AC 22 ms 916 KB
subtask1_06.txt AC 22 ms 800 KB
subtask1_07.txt AC 21 ms 748 KB
subtask1_08.txt AC 21 ms 920 KB
subtask1_09.txt AC 21 ms 804 KB
subtask1_10.txt AC 22 ms 736 KB
subtask1_11.txt AC 23 ms 800 KB
subtask1_12.txt AC 22 ms 928 KB
subtask1_13.txt AC 23 ms 928 KB
subtask1_14.txt AC 21 ms 924 KB
subtask1_15.txt AC 21 ms 928 KB