1980B - Choosing Cubes - CodeForces Solution


sortings sortings

Please click on ads to support us..

Python Code:

x=int(input())
for i in range(x):
    l=[]
    less=0
    equal=0
    more=0
    y=input().split()
    z=input().split()
    n=y[0]
    f=y[1]
    k=y[2]
    fvalue=z[int(f)-1]
    for j in z:
        if int(j)<int(fvalue):
            less+=1
        elif int(j)==int(fvalue):
            equal+=1
        else:
            more+=1

    for _ in range(int(n)):
        l.append(int(z[_]))


    if more>=int(k):
        print("NO")
    elif equal+more>int(k):
        print("maybe")
    elif equal+more<=int(k):
        print("Yes")


Comments

Submit
0 Comments
More Questions

Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately