1945F - Kirill and Mushrooms - CodeForces Solution


data structures sortings *1900

Please click on ads to support us..

Python Code:

from heapq import heappop, heappush
 
for _ in range(int(input())):
    x=int(input())
    a=list(map(int, input().split()))
    b=list(map(int, input().split()))
    h=[]
    ans=0
    p=-1
    for i in range(x-1,-1,-1):
        heappush(h,a[b[i]-1])
        while len(h)>i+1:
            heappop(h)
        r=h[0]*len(h)
        if r>=ans:
            ans=r
            p=i+1
    print(ans,p)


Comments

Submit
0 Comments
More Questions

933A - A Twisty Movement
1722F - L-shapes
1196B - Odd Sum Segments
1325D - Ehab the Xorcist
552B - Vanya and Books
1722E - Counting Rectangles
168A - Wizards and Demonstration
168B - Wizards and Minimal Spell
7A - Kalevitch and Chess
912B - New Year's Eve
1537C - Challenging Cliffs
879B - Table Tennis
1674E - Breaking the Wall
1282A - Temporarily unavailable
1366C - Palindromic Paths
336A - Vasily the Bear and Triangle
926A - 2-3-numbers
276D - Little Girl and Maximum XOR
1253C - Sweets Eating
1047A - Little C Loves 3 I
758D - Ability To Convert
733A - Grasshopper And the String
216A - Tiling with Hexagons
1351B - Square
1225A - Forgetting Things
1717A - Madoka and Strange Thoughts
1717B - Madoka and Underground Competitions
61B - Hard Work
959B - Mahmoud and Ehab and the message
802G - Fake News (easy)