For this Question: Alita has two a sequence of numbers x1, x2,…..xn. She has to go fight a battle with these sequence of numbers. But these numbers are not correct for the battle. She has to convert these numbers to another sequence of numbers y1, y2,…….yn. Alita is busy preparing for the battle so she needs your help.
There is only two type of moves you can perform on any xi (where 1<=i<=n) only.
You have to make initial sequence (x1, x2…..xn) equal to the correct sequence (y1, y2,...yn) in minimum number of moves.
Moreover you can not rearrange anything.
There are two types of moves :-
1. Multiply xi by 2.
2. Decrease xi by 1.

Calculate the minimum number of moves required.
Help Alita!!The first line of input contains the size of array N. 
The second line contains the array x1, x2,...xn.
The second line contains the array y1, y2,...yn.


Constraints:-
1 <= N <= 100000 
1 <= xi, yi <10^9Print the minimum number of operation required.Sample Input:
4
3 12 2 4
15 9 17 5

Sample Output:
19

Explanation:
For 3 to 15:-     3->2->4->8->16->15 = 5
For 12 to 9:-     12->11->10->9 = 3
For 2 to 17:-     2->4->3->6->5->10->9->18->17 = 8
For 4 to 5:-       4->3->6->5 = 3
total operation = 5+3+8+3 = 19

Sample Input:
1
6077
27091

Sample Output:
2695, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;


int main(){


int n;
cin>>n;
long long a[n],b[n];
for(int i=0;i<n;i++){
    cin>>a[i];
}
long long ans=0;
for(int i=0;i<n;i++){
cin>>b[i];}
    for(int i=0;i<n;i++){
        long long x=a[i],y=b[i];


       while(y>x){
        if(y&1){y++;ans++;}
        else{y=y/2;ans++;}
       }
       ans+=x-y;

    }
       cout<<ans<<endl;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?