An abandoned sentiment from past

题意翻译

题目描述 给出一个长度为$N$的非负整数序列$a_i$与长度为$K$的正整数序列$b_i$，满足$a_i$中刚好有$K$个$0$，且任一正整数在序列$a$和序列$b$中的出现次数的和不会超过$1$。现在试判断是否存在一种方法，使得用$b_i$中的元素替换$a_i$中的$0$得到的序列不是递增序列。 输入数据 第一行两个整数$N,K(2 \leq N \leq 100 , 1 \leq K \leq N)$表示序列$a$与序列$b$的长度 第二行$N$个非负整数$a_i(0 \leq a_i \leq 200)$描述序列$a$ 第三行$K$个正整数$b_i(1 \leq b_i \leq 200)$描述序列$b$ 输出数据 如果存在一种方案满足题意，输出$Yes$，否则输出$No$

题目描述

A few years ago, Hitagi encountered a giant crab, who stole the whole of her body weight. Ever since, she tried to avoid contact with others, for fear that this secret might be noticed. To get rid of the oddity and recover her weight, a special integer sequence is needed. Hitagi's sequence has been broken for a long time, but now Kaiki provides an opportunity. Hitagi's sequence $ a $ has a length of $ n $ . Lost elements in it are denoted by zeros. Kaiki provides another sequence $ b $ , whose length $ k $ equals the number of lost elements in $ a $ (i.e. the number of zeros). Hitagi is to replace each zero in $ a $ with an element from $ b $ so that each element in $ b $ should be used exactly once. Hitagi knows, however, that, apart from $ 0 $ , no integer occurs in $ a $ and $ b $ more than once in total. If the resulting sequence is not an increasing sequence, then it has the power to recover Hitagi from the oddity. You are to determine whether this is possible, or Kaiki's sequence is just another fake. In other words, you should detect whether it is possible to replace each zero in $ a $ with an integer from $ b $ so that each integer from $ b $ is used exactly once, and the resulting sequence is not increasing.

输入输出格式

输入格式

The first line of input contains two space-separated positive integers $ n $ ( $ 2<=n<=100 $ ) and $ k $ ( $ 1<=k<=n $ ) — the lengths of sequence $ a $ and $ b $ respectively. The second line contains $ n $ space-separated integers $ a_{1},a_{2},...,a_{n} $ ( $ 0<=a_{i}<=200 $ ) — Hitagi's broken sequence with exactly $ k $ zero elements. The third line contains $ k $ space-separated integers $ b_{1},b_{2},...,b_{k} $ ( $ 1<=b_{i}<=200 $ ) — the elements to fill into Hitagi's sequence. Input guarantees that apart from $ 0 $ , no integer occurs in $ a $ and $ b $ more than once in total.

输出格式

Output "Yes" if it's possible to replace zeros in $ a $ with elements in $ b $ and make the resulting sequence not increasing, and "No" otherwise.

输入输出样例

输入样例 #1

4 2
11 0 0 14
5 4

输出样例 #1

Yes

输入样例 #2

6 1
2 3 0 8 9 10
5

输出样例 #2

No

输入样例 #3

4 1
8 94 0 4
89

输出样例 #3

Yes

输入样例 #4

7 7
0 0 0 0 0 0 0
1 2 3 4 5 6 7

输出样例 #4

Yes

说明

In the first sample: - Sequence $ a $ is $ 11,0,0,14 $ . - Two of the elements are lost, and the candidates in $ b $ are $ 5 $ and $ 4 $ . - There are two possible resulting sequences: $ 11,5,4,14 $ and $ 11,4,5,14 $ , both of which fulfill the requirements. Thus the answer is "Yes". In the second sample, the only possible resulting sequence is $ 2,3,5,8,9,10 $ , which is an increasing sequence and therefore invalid.

题意翻译

题目描述 给出一个长度为$N$的非负整数序列$a_i$与长度为$K$的正整数序列$b_i$，满足$a_i$中刚好有$K$个$0$，且任一正整数在序列$a$和序列$b$中的出现次数的和不会超过$1$。现在试判断是否存在一种方法，使得用$b_i$中的元素替换$a_i$中的$0$得到的序列不是递增序列。 输入数据 第一行两个整数$N,K(2 \leq N \leq 100 , 1 \leq K \leq N)$表示序列$a$与序列$b$的长度 第二行$N$个非负整数$a_i(0 \leq a_i \leq 200)$描述序列$a$ 第三行$K$个正整数$b_i(1 \leq b_i \leq 200)$描述序列$b$ 输出数据 如果存在一种方案满足题意，输出$Yes$，否则输出$No$