1989C - Two Movies - CodeForces Solution


greedy

Please click on ads to support us..

Python Code:

t = int(input())
for _ in range(t):
    n = int(input())
    a = [int(i) for i in input().strip().split()]
    b = [int(i) for i in input().strip().split()]
    ra = 0
    rb = 0
    add = 0
    sub = 0
    for i in range(n):
        if a[i]>b[i]: ra += a[i]
        elif b[i]>a[i]: rb += b[i]
        elif a[i]>0: add += a[i]
        elif a[i]<0: sub -= a[i]
    for i in range(add):
        if ra<rb: ra += 1
        else: rb += 1
    for i in range(sub):
        if ra<rb: rb -= 1
        else: ra -= 1
    print(min(ra,rb))


Comments

Submit
0 Comments
More Questions

WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines