CFrou99 D. Sequence and Swaps 【思维】

You are given a sequence a consisting of n integers a1,a2,…,an, and an integer x. Your task is to make the sequence a sorted (it is considered sorted if the condition a1≤a2≤a3≤⋯≤an holds).

To make the sequence sorted, you may perform the following operation any number of times you want (possibly zero): choose an integer i
such that 1≤i≤n and ai>x, and swap the values of ai and x.

For example, if a=[0,2,3,5,4], x=1, the following sequence of operations is possible: choose i=2

(it is possible since a2>x), then a=[0,1,3,5,4], x=2;
choose i=3(it is possible since a3>x), then a=[0,1,2,5,4], x=3;
choose i=4(it is possible since a4>x), then a=[0,1,2,3,4], x=5 .

Calculate the minimum number of operations you have to perform so that a

becomes sorted, or report that it is impossible.
Input

The first line contains one integer t(1≤t≤500) — the number of test cases.

Each test case consists of two lines. The first line contains two integers n
and x (1≤n≤500, 0≤x≤500) — the number of elements in the sequence and the initial value of x.

The second line contains n integers a1, a2, …, an (0≤ai≤500).

The sum of values of n over all test cases in the input does not exceed 500.
Output

For each test case, print one integer — the minimum number of operations you have to perform to make a
sorted, or −1

, if it is impossible.
Example
Input
Copy

6
4 1
2 3 5 4
5 6
1 1 3 4 4
1 10
2
2 10
11 9
2 10
12 11
5 18
81 324 218 413 324

Output
Copy

3
0
0
-1
1
3

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int n, x;

bool judge(int i) {
	for(; i <= n; i++) {
		if(a[i] < a[i - 1])	return false; 
	}
	return true;
}

void solve() {
	cin >> n >> x;
	for(int i = 1; i <= n;i ++) cin >> a[i];
	int sum = 0;
	for(int i = 1; i <= n; i++) {
		if(a[i] > x) {
			if(judge(i + 1))
				break;
			swap(a[i], x);
			sum++;
		}
	}
	for(int i = 2; i <= n; i++) {
		if(a[i] < a[i - 1])sum = -1;
	}
	cout << sum << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--)
		solve();
	return 0;
}