// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<pair<int, int>> a(n);
int osszegver=0;
int legkisebbver=INT_MAX;
for(int i=0;i<n;i++){
cin>>a[i].first;
osszegver+=a[i].first;
legkisebbver=min(a[i].first, legkisebbver);
}
int osszegham=0;
int legkisebbham=INT_MAX;
for(int i=0;i<n;i++){
cin>>a[i].second;
osszegham+=a[i].second;
legkisebbham=min(legkisebbham, a[i].second);
}
if(osszegham>osszegver){
cout<<"Verstappen\n";
}else{
cout<<"Hamilton\n";
}
if(legkisebbver>legkisebbham){
cout<<"Hamilton\n";
}else{
cout<<"Verstappen\n";
}
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Wrong answer | 3ms | 1812 KiB | ||||
2 | Wrong answer | 3ms | 2060 KiB | ||||
subtask2 | 0/10 | ||||||
3 | Wrong answer | 3ms | 2264 KiB | ||||
4 | Wrong answer | 3ms | 2516 KiB | ||||
5 | Wrong answer | 3ms | 2760 KiB | ||||
6 | Wrong answer | 3ms | 2996 KiB | ||||
subtask3 | 0/15 | ||||||
7 | Wrong answer | 3ms | 3028 KiB | ||||
8 | Wrong answer | 3ms | 3196 KiB | ||||
9 | Wrong answer | 3ms | 3300 KiB | ||||
10 | Wrong answer | 3ms | 3544 KiB | ||||
11 | Wrong answer | 2ms | 3600 KiB | ||||
subtask4 | 0/20 | ||||||
12 | Wrong answer | 2ms | 3704 KiB | ||||
13 | Wrong answer | 3ms | 3760 KiB | ||||
14 | Wrong answer | 2ms | 3764 KiB | ||||
15 | Wrong answer | 2ms | 3768 KiB | ||||
16 | Wrong answer | 3ms | 4000 KiB | ||||
17 | Wrong answer | 2ms | 3900 KiB | ||||
18 | Wrong answer | 3ms | 3804 KiB | ||||
19 | Wrong answer | 2ms | 3884 KiB | ||||
subtask5 | 0/55 | ||||||
20 | Wrong answer | 3ms | 3880 KiB | ||||
21 | Wrong answer | 2ms | 3884 KiB | ||||
22 | Wrong answer | 2ms | 3892 KiB | ||||
23 | Wrong answer | 3ms | 4052 KiB | ||||
24 | Wrong answer | 3ms | 4156 KiB | ||||
25 | Wrong answer | 3ms | 4112 KiB | ||||
26 | Wrong answer | 3ms | 4356 KiB | ||||
27 | Wrong answer | 3ms | 4452 KiB | ||||
28 | Wrong answer | 3ms | 4532 KiB |