Submission #183318
Source Code Expand
#include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <cstring> #include <climits> #include <cassert> #include <iostream> #include <vector> #include <list> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <bitset> #include <complex> #include <algorithm> #include <numeric> #include <exception> using namespace std; typedef pair<int,int> Pii; typedef long long ll; typedef unsigned long long ull; const int INFI = 1<<28; const long long int INFL = 1LL<<60; const double INFD = 1e+300; const double EPS = 1e-8; //> ^ < v //int dx[] = {1,0,-1,0}; //int dy[] = {0,-1,0,1}; //struct P { // int id, cost; // P () {} // P (int i, int c) : id(i), cost(c) {} // bool operator < (const P &p) const { return cost > p.cost; } //}; int main(){ int ans=0; //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } for (int i = 0; i < n; i++) { ans += max(a[i],b[i]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | inuhiroshi |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1186 Byte |
Status | WA |
Exec Time | 28 ms |
Memory | 932 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
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 | WA | 28 ms | 916 KB |
subtask0_sample-02.txt | WA | 20 ms | 800 KB |
subtask0_sample-03.txt | AC | 21 ms | 804 KB |
subtask0_sample-04.txt | WA | 21 ms | 928 KB |
subtask1_01.txt | WA | 21 ms | 924 KB |
subtask1_02.txt | WA | 22 ms | 932 KB |
subtask1_03.txt | WA | 21 ms | 920 KB |
subtask1_04.txt | WA | 20 ms | 924 KB |
subtask1_05.txt | WA | 20 ms | 796 KB |
subtask1_06.txt | WA | 22 ms | 804 KB |
subtask1_07.txt | WA | 21 ms | 800 KB |
subtask1_08.txt | WA | 21 ms | 924 KB |
subtask1_09.txt | WA | 22 ms | 804 KB |
subtask1_10.txt | WA | 22 ms | 796 KB |
subtask1_11.txt | WA | 22 ms | 764 KB |
subtask1_12.txt | WA | 22 ms | 928 KB |
subtask1_13.txt | WA | 22 ms | 924 KB |
subtask1_14.txt | WA | 22 ms | 796 KB |
subtask1_15.txt | WA | 22 ms | 920 KB |