Submission #1328554

#TimeUsernameProblemLanguageResultExecution timeMemory
1328554tomthuy123Railway Trip 2 (JOI22_ho_t4)C++20
0 / 100
11 ms2776 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1e9 + 7;

ll AllNegative=1;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	
	ll n,m;
	cin >> n >> m;
	vector<ll> Alst(n);
	vector<ll> Blst(n);
	for(ll i=0;i<n;i++){
		cin >> Alst[i];
	}
	for(ll i=0;i<n;i++){
		cin >> Blst[i];
	}
	vector<ll> Comprehension(n,0);
	for(ll i=0;i<n;i++){
		Comprehension[i]+=max(Alst[i],Blst[i]);
	}
	ll ans=LLONG_MIN;
	for(ll i:Comprehension){
		ans=max(ans,i);
	}
	cout << ans;
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...