Problem Description

Given two sorted arrays, merge them into one sorted array. Count and return the minimum number of comparisons needed during the merge process.

Input Format

First line: n m (sizes). Second line: n sorted integers. Third line: m sorted integers.

Output Format

Two lines: merged sorted array (space-separated), then number of comparisons made.

Constraints

• 1 ≤ n, m ≤ 1000

• Arrays are already sorted in ascending order

• -1000 ≤ array elements ≤ 1000

• Count each element comparison during merge

• Use optimal merge algorithm

Sample Input/Output

Explanation

Merge process: Compare 1<2 (1), 3>2 (2), 3<4 (3), 5>4 (4). Total comparisons: 4.