The Excel portion of your question is not related to the merging of two data structures, and might just be distracting you from solving the actual problem. Solve the first problem (the merging) first.

When you say "merge", you mean one of two things; this:

my @merged = ( \@arr, \@arr1 );
[download]

...or this...

my @merged = ( @arr, @arr1 );
[download]

You probably are after that second option: my @merged = ( @arr, @arr1 );. Currently you have this:

my @merged = ( @arr, \@arr1 );
[download]

...which is probably wrong due to its asymmetry.

Once you determine whether you need the first "merge" or the second one, you should then be able to populate the worksheet like this:

$worksheet1->write_col('A3',\@merged);
[download]

UPDATE: After looking at your previous post: Simplest way to match/filter 2d array of values to search in perl, I'm wondering if this is what you're doing:

1. Start with a 2d array (possibly extracted from a worksheet).
2. Find all the rows containing some element greater than a certain value.
3. Derive two arrays; one with rows that passed the threshold, and one containing the remainder, which didn't pass the threshold.
4. Join the two arrays (which is why, in this question, you wanted to preserve the order).
5. Write the structure out to a workbook.

If this sounds familiar, what you are doing is called partitioning. A very capable module for partitioning in Perl is Sort::Key::Top. You might look into it to see if it helps simplify your solution.