We are given a file of three columns
- the first is player name
- the second is game item name
- the third is the price of the game item when bought by the player
items may repeat for the same player with different prices
What is the best parallel approach in time and space to get
the player name with the highest sum of all items prices while keeping the most
5 valued items in descending order in ascending alphabetically?
My attempt is to read the file in parallel and then each node should read its chunk line by line and sum the total of prices for each player and always update the most valued 5 items to the above constraint.
This is just my logical analysis of the problem but I don't know if I am correct
