Submission #464785

#TimeUsernameProblemLanguageResultExecution timeMemory
464785jurgisExam (eJOI20_exam)C++14
0 / 100
5 ms204 KiB
#include <iostream>
#include <bits/stdc++.h>
#define f first
#define s second
#define pii pair<int, int>
#define ll long long
using namespace std;

int main()
{
    int n; cin>>n; 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];} bool found = false; int cnt =0; int tempcnt =0;
    for(int i=0; i<n; i++){

       if(A[i] == B[0]){found = true;} //cout<<A[i]<<B[0]<<endl;
        if(A[i]>B[0]){
            if(found){
                found = false;cnt+= tempcnt;
            }
            tempcnt = 0;

        }tempcnt++;
        if(i==n-1 && found){
            cnt+= tempcnt;
        }
    }
    cout<<cnt;

}
#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...