Skip to content

Commit 364d7be

Browse files
committed
814A - An abandoned sentiment from past
1 parent fcab084 commit 364d7be

File tree

1 file changed

+57
-0
lines changed

1 file changed

+57
-0
lines changed

Codeforces/PracticeProblems/814A.cpp

+57
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
/* Amit Bansal - @amitbansal7 */
2+
#include <bits/stdc++.h>
3+
#include <string>
4+
#define lli long long int
5+
#define llu unsigned long long int
6+
#define S(x) scanf("%d",&x)
7+
#define Sl(x) scanf("%lld",&x)
8+
#define Mset(p,i) memset(p,i,sizeof(p))
9+
#define mlc(t,n) (t *)malloc(sizeof(t)*n)
10+
#define NIL -1
11+
#define INF 0x3f3f3f3f
12+
#define TC int testcase; S(testcase); while(testcase--)
13+
#define Pi 3.14159
14+
using namespace std;
15+
16+
17+
int main()
18+
{
19+
int a,k;
20+
S(a);S(k);
21+
22+
int *A = mlc(int,a);
23+
for(int i=0;i<a;i++)
24+
S(A[i]);
25+
26+
int *K = mlc(int,k);
27+
for(int i=0;i<k;i++)
28+
S(K[i]);
29+
30+
sort(K,K+k,greater<int>());
31+
32+
int j =0;
33+
int f = 0;
34+
for(int i=0;i<a;i++)
35+
{
36+
if(A[i] == 0)
37+
{
38+
A[i] = K[j];
39+
j++;
40+
}
41+
}
42+
43+
for(int i=0;i<a-1;i++)
44+
if(A[i] > A[i+1])
45+
{
46+
f = 1;
47+
break;
48+
}
49+
50+
if(f)
51+
printf("Yes\n");
52+
else
53+
printf("No\n");
54+
55+
return 0;
56+
}
57+

0 commit comments

Comments
 (0)