For this Question: You are given two strings S1 and S2 of length N. You need to make those strings equal by replacing any index in string S1 with any character. The cost incurred is as follows:
You pay X units for the first replacement, you do not pay anything for the second replacement, you pay X units for the third replacement, you do not pay anything for the fourth replacement, and so on.

Find the total units you need to pay to make S1 equal to S2.The first line of the input contains two integers, N and X.
The second and third lines of the input contain strings S1 and S2 respectively.

Constraints
1 <= N <= 200000
1 <= X <= 100
S1 and S2 contain lowercase characters of the english alphabet.Output a single integer, the number of units we need to pay.Sample Input
5 2
abcde
bbcce

Sample Output
2

Explanation: 
Step 1: We replace character at index 1 from 'a' to 'b'. Total cost: 2.
Step 2: We replace character at index 4 from 'd' to 'c'. Total cost: 2., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws Exception
    {
        InputStreamReader ir = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(ir);

        String[] input = br.readLine().split(" ");
        int n = Integer.parseInt(input[0]);
        long x = Long.parseLong(input[1]);
        String s1 = br.readLine();
        String s2 = br.readLine();

        long count = 0;
        for (int i=0; i<n; i++) {
            if(s1.charAt(i) != s2.charAt(i))
                count++;
        }

        long ans = count%2==0 ? (count/2)*x : (count/2)*x + x;

        System.out.println(ans);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?