Q1. Use the linked list to solve the following problem.
There are n apples with known weights. Your task is to divide the apples into
two groups so that the difference between the weights of the groups is minimal.
Input
The first input line has an integer n: the number of apples.
The next line has n integers P1, P2, ...,Pr: the weight of each apple.
Output
Print one integer: the minimum difference between the weights of the groups.
Constraints
• 1720
1 <P; <10°
Answers
Answered by
0
Answer:
Chung big him bath Iggy high do guy km guy km of
Similar questions