Disjoint Non-Decreasing Array

Little R is a magician who likes non-decreasing arrays. She has an array of length n𝑛, initially as a1,…,an𝑎1,…,𝑎𝑛, in which each element is an integer between [1,m][1,𝑚]. She wants it to be non-decreasing, i.e., a1≤a2≤…≤an𝑎1≤𝑎2≤…≤𝑎𝑛.To do this, she can perform several magic tricks. Little R has a fixed array b1…bm𝑏1…𝑏𝑚 of length m𝑚. Formally, let's define a trick as a procedure that does the following things in order:Choose a set S⊆{1,2,…,n}𝑆⊆{1,2,…,𝑛}.For each u∈S𝑢∈𝑆, assign au𝑎𝑢 with bau𝑏𝑎𝑢.Little R wonders how many tricks are needed at least to make the initial array non-decreasing. If it is not possible with any amount of tricks, print −1−1 instead.InputEach test contains multiple test cases. The first line contains the number of test cases t𝑡 (1≤t≤1041≤𝑡≤104). The description of the test cases follows.The first line of each test case contains two integers n𝑛 and m𝑚 (1≤n≤1061≤𝑛≤106, 1≤m≤1061≤𝑚≤106) — the length of the initial array and the range of the elements in the array.The second line of each test case contains n𝑛 integers a1,…,an𝑎1,…,𝑎𝑛 (1≤ai≤m1≤𝑎𝑖≤𝑚) — the initial array.The third line of each test case contains m𝑚 integers b1,…,bm𝑏1,…,𝑏𝑚 (1≤bi≤m1≤𝑏𝑖≤𝑚) — the fixed magic array.It is guaranteed that the sum of n𝑛 over all test cases does not exceed 106106 and the sum of m𝑚 over all test cases does not exceed 106106.OutputFor each test case, output a single integer: the minimum number of tricks needed, or −1−1 if it is impossible to make a1,…,an𝑎1,…,𝑎𝑛 non-decreasing.ExampleinputCopy35 81 6 3 7 12 3 5 8 7 1 5 63 31 3 22 1 310 102 8 5 4 8 4 1 5 10 106 7 2 6 3 4 1 1 3 5outputCopy3-13

Remove Duplicates from Sorted Array

Given two sorted arrays arr1[] and arr2[] of sizes n and m in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.

You are given a 0-indexed array of distinct integers nums.There is an element in nums that has the lowest value and an element that has the highest value. We call them the minimum and maximum respectively. Your goal is to remove both these elements from the array.A deletion is defined as either removing an element from the front of the array or removing an element from the back of the array.Return the minimum number of deletions it would take to remove both the minimum and maximum element from the array.

Given an array of N integers containing only 0 or 1. You can do the following operations on the array:swap elements at two indiceschoose one index and change its value from 0 to 1 or vice-versa.You have to do the minimum number of the above operations such that the final array is non-decreasing.Note Consider 1 based Array-indexing