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

You are playing a game with your friend Ajay where Ajay gave you an array 'A' consisting of 'N' integers such that all the elements of the array does not exceed the value 'K'.Ajay has asked you to replace the minimum number of elements (replacement is the following operation: choose some index i from 1 to n and replace a[i] with some integer in range [1;k] ) to satisfy the following conditions:after all replacements, all a[i] are positive integers not greater than k;for all i from 1 to n/2 the following equation is true: a[i]+a[n]−i+1=x, where x should be the same for all n/2 pairs of elements.Note: It is guaranteed that 'N' is even.Input FormatThe first line contains two integers n and k — the length of a and the maximum possible value of some a[i] correspondingly. It is guratanteed that n is even .The second line of the test case contains n integers a1,a2,…,an, where ai is the i-th element of a.Constraints2≤n≤2⋅10^51≤k≤2⋅10^51≤a[i]≤kOutput FormatPrint the integer — the minimum number of elements you have to replace in a to satisfy the conditions from the problem statement.Sample Input 04 41 1 3 1Sample Output 01Sample Input 16 71 1 1 1 2 2Sample Output 11

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

Disjoint Non-Decreasing Array

Meet Alex, a bright student who is dealing with an array challenge today. He has been given an array a1, a2, ..., aN of length N. The intriguing aspect of this challenge is that Alex can perform various operations on the array elements.In a single operation, Alex is allowed to choose two indices l and r, where 1 ≤ l ≤ r ≤ n. He can then multiply all the elements in the subarray [al, al+1, ..., ar] by -1, effectively reversing their signs.Being pressed for time as he is running late for school, Alex is seeking your assistance in determining the maximum possible sum of numbers in the array. Additionally, he is eager to find out the minimum number of operations required to achieve this maximum sum.

Write a function:class Solution { public int solution(int[] A); }that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.Given A = [1, 2, 3], the function should return 4.Given A = [−1, −3], the function should return 1.Write an efficient algorithm for the following assumptions:N is an integer within the range [1..100,000];each element of array A is an integer within the range [−1,000,000..1,000,000].