Submission #183415
Source Code Expand
#include <iostream> #include <cstdlib> #include <cstdio> #include <cstring> #include <cmath> #include <stack> #include <queue> #include <cctype> #include <complex> #include <vector> #include <set> #include <map> #include <algorithm> #include <functional> #include <cassert> #include <iomanip> using namespace std; #define pb push_back #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() typedef long long ll; typedef complex<int> P; typedef pair<int,int> pii; const double EPS = 1e-10; const double PI = acos(-1.0); template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t;} bool solve(){ int n = 7; 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]; int ans = 0; for(int i=0;i<n;i++) ans += max(a[i], b[i]); cout<< ans<< endl; return true; } int main(){ cout.setf(ios::fixed); cout.precision(10); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | yokabb |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 994 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | AC | 21 ms | 804 KB |
subtask0_sample-02.txt | AC | 20 ms | 744 KB |
subtask0_sample-03.txt | AC | 22 ms | 676 KB |
subtask0_sample-04.txt | AC | 21 ms | 676 KB |
subtask1_01.txt | AC | 22 ms | 792 KB |
subtask1_02.txt | AC | 21 ms | 800 KB |
subtask1_03.txt | AC | 24 ms | 800 KB |
subtask1_04.txt | AC | 20 ms | 796 KB |
subtask1_05.txt | AC | 26 ms | 812 KB |
subtask1_06.txt | AC | 23 ms | 808 KB |
subtask1_07.txt | AC | 21 ms | 744 KB |
subtask1_08.txt | AC | 20 ms | 804 KB |
subtask1_09.txt | AC | 21 ms | 800 KB |
subtask1_10.txt | AC | 21 ms | 800 KB |
subtask1_11.txt | AC | 20 ms | 924 KB |
subtask1_12.txt | AC | 20 ms | 800 KB |
subtask1_13.txt | AC | 21 ms | 796 KB |
subtask1_14.txt | AC | 21 ms | 928 KB |
subtask1_15.txt | AC | 21 ms | 804 KB |