[BAILIAN] hihoCoder Challenge 34 register

Ended

Participants:186

Verdict:Accepted
Submitted:2018-07-15 18:54:11

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+10;
ll a[maxn],b[maxn];
int main(){
    int t;
    cin>>t;
    int j=1;
    while(t--){
        int n,m;
        cin>>n>>m;
        ll Max=-1e18;
        ll Min=1e18;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=m;i++)
        {
            cin>>b[i];
            if(b[i]>Max)
                Max=b[i];
            if(b[i]<Min)
                Min=b[i];
        }
        ll p=-1e18,pos;
        for(int i=1;i<=n;i++)
        {
            if(p<=a[i]){
                p=a[i];
                pos=i;
            }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX