路上的球

最新推荐文章于 2023-12-19 22:52:36 发布

黑夜中坚持

最新推荐文章于 2023-12-19 22:52:36 发布

阅读量171

点赞数

分类专栏：针对lcy编程贪婪算法文章标签：算法

本文链接：https://blog.csdn.net/qq_26496077/article/details/103392516

版权

针对lcy编程同时被 2 个专栏收录

42 篇文章 4 订阅

订阅专栏

贪婪算法

7 篇文章 0 订阅

订阅专栏

Description
There are two parallel roads, each containing N and M buckets, respectively. Each bucket may contain some balls. The buckets on both roads are kept in such a way that they are sorted according to the number of balls in them. Geek starts from the end of the road which has the bucket with a lower number of balls(i.e. if buckets are sorted in increasing order, then geek will start from the left side of the road). The geek can change the road only at the point of intersection(which means, buckets with the same number of balls on two roads). Now you need to help Geek to collect the maximum number of balls.

Input
The first line of input contains T denoting the number of test cases. The first line of each test case contains two integers N and M, denoting the number of buckets on road1 and road2 respectively. 2nd line of each test case contains N integers, number of balls in buckets on the first road. 3rd line of each test case contains M integers, number of balls in buckets on the second road.

Constraints:1<= T <= 1000，1<= N <= 10^3，1<= M <=10^3，0<= A[i],B[i]<=10^6

Output
For each test case output a single line containing the maximum possible balls that Geek can collect.

Sample Input 1
1
5 5
1 4 5 6 8
2 3 4 6 9

Sample Output 1
29

def solution(l2, l3, m ,n):
    i = 0
    j = 0
    start2 = 0
    start3 = 0
    res = 0
    while i < m and j < n:
        if l2[i] < l3[j]:
            i += 1
        elif l2[i] > l3[j]:
            j += 1
        else:
            res += max(sum(l2[start2: i+1]), sum(l3[start3: j+1]))
            i += 1
            j += 1
            start2 = i
            start3 = j
    if len(l2[start2:]) != 0 and len(l3[start3:]) != 0:
        res += max(sum(l2[start2:]), sum(l3[start3:]))
    elif len(l2[start2:]) != 0:
        res += sum(l2[start2:])
    elif len(l3[start3:]) != 0:
        res += sum(l3[start3:])
    return res


if __name__ == "__main__":
    n = int(input())
    for _ in range(n):
        l1 = list(map(int, input().strip().split()))
        m, n = l1[0], l1[1]
        l2 = list(map(int, input().strip().split()))
        l3 = list(map(int, input().strip().split()))
        result = solution(l2, l3, m, n)
        print(result)