constructive algorithms greedy implementation sortings *900

Please click on ads to support us..

Python Code:

a,b=map(int,input().split())

x=list(map(int,input().split()))

y=list(map(int,input().split()))

y.sort()

j=b-1

for i in range(a):

    if x[i]==0:

        x[i]=y[j]

        j=j-1

t=sorted(x)

c=0

for i in range(a):

    if t[i]!=x[i]:

      print("Yes")

      c=1

      break
if(c==0):

      print("No")
        


Comments

Submit
0 Comments
More Questions

1679B - Stone Age Problem
402A - Nuts
792A - New Bus Route
221A - Little Elephant and Function
492C - Vanya and Exams
1369B - AccurateLee
892B - Wrath
999A - Mishka and Contest
727C - Guess the Array
1625C - Road Optimization
1715D - 2+ doors
267A - Subtractions
1582A - Luntik and Concerts
560A - Currency System in Geraldion
946A - Partition
1068B - LCM
1692E - Binary Deque
679A - Bear and Prime 100
488A - Giga Tower
14A - Letter
1150A - Stock Arbitraging
1552A - Subsequence Permutation
1131F - Asya And Kittens
1475F - Unusual Matrix
133B - Unary
1547A - Shortest Path with Obstacle
624A - Save Luke
1238A - Prime Subtraction
1107C - Brutality
1391B - Fix You