ChessMatchup
SRM 371 · 2007-10-13 · by bmerry
Problem Statement
Your chess club is playing a match against an opposing chess club. Each club enters N players into the match, and each player plays one game against a player from the other team. Each game that is won is worth 2 points, and each game that is drawn is worth 1 point. Your goal is to score as many points as possible.
Your secret agents have determined the skill of every member of the opposing team, and of course you know the skill of every member of your own team. You can use this information to decide which opposing player will play against each of your players in order to maximize your score. Assume that the player with the higher skill in a game will always win, and if the players have the same skill then they will draw.
You will be given
Constraints
- us and them will each contain between 1 and 50 elements, inclusive.
- us and them will contain the same number of elements.
- Each element of us and them will be between 1 and 1000, inclusive.
{5, 8}
{7, 3}
Returns: 4
By playing 5 against 3 and 8 against 7, you can win both games.
{7, 3}
{5, 8}
Returns: 2
This is the reverse of the previous case. By playing 7 against 5 and 3 against 8, you can win one game.
{10, 5, 1}
{10, 5, 1}
Returns: 4
If you play matching pairs you will draw all three games for 3 points. However, playing 10-5, 5-1 and 1-10 gives you two wins and a loss, for 4 points.
{1, 10, 7, 4}
{15, 3, 8, 7}
Returns: 5
{1}
{1}
Returns: 1
Submissions are judged against all 66 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Language: C++17 · define a public class ChessMatchup with a public method int maximumScore(vector<int> us, vector<int> them) · 66 test cases · 2 s / 256 MB per case