Team Play

Undefined

English

Two teams of robots are playing the game of cut-or-bend . The rules of the game are very simple:

The team that has processed more details than its opponent is a winner.
A detail is considered to be processed if it is either bent or cut.
Each robot can perform both bending and cutting, but during the game it can perform only one of two functions.
Each team consists of N players, K of them must be occupied with cutting. All the rest must be occupied with bending.

Suppose you are the coach of one of these teams. You are given two lists of positive integers both of size N representing stats of your team. The i-th value in the first list is the number of details that can be cut by the i-th member of the team during the game. Similarly, the i-th value in the second list is the number of details which can be bent by the i-th member of the team during the game. Knowing the value of K, calculate the maximum score which can be obtained by your team.

Input: Three arguments. Two lists of integers of equal size representing team's stats. An integer - a number of team's members that have to be occupied with cutting.

Output: An integer - the maximum score which can be obtained by the team.

Example:

Consider having input to be [4, 2, 1], [2, 5, 3], 2 . The best score is obtained by assigning the first and the third robots to perform cutting and the second robot to perform bending.

cut : [4, _, 1] -> total:  5
bend: [_, 5, _] -> total:  5
------------------------------
                   total: 10

max_score([4, 2, 1], [2, 5, 3], 2) == 10
max_score([7, 1, 4, 4], [5, 3, 4, 3], 2) == 18
max_score([5, 5, 5], [5, 5, 5], 1) == 15

How it’s used: This is a discrete optimization puzzle. As Leonhard Euler has stated, "Nothing in the world takes place without optimization, and there is no doubt that all aspects of the world that have a rational basis can be explained by optimization methods."

Precondition: 3 ≤ N ≤ 50 1 ≤ K ≤ N - 1 1 ≤ list[i] ≤ 100

maximum

by:

Rating: 10 Login to vote

Solve as a guest
Sign in to your account

Settings

Code:

Auto close brackets and quotes
Highlight the same word

Other:

Auto scroll to the best solutions after successful check
Do not show the best solutions (but those are still available after "View All Solutions" button)

Invalid hot key. Each hot key should be unique and valid

Hot keys:

to Run Code:
to Check Solution:
to Stop:

Save & Reload Close

CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)