**Question**\nGiven a list of `n` players, select a team with maximum score and no conflicts. Conflicts arise when a younger player has more score than elder player.\n\n**Input format**\nn\nage2 age2 . . . agen\nscore2 score2 . . . scoren\n\n**Sample Input 0**\n```\n5\n7010 7020 7015 7025 7005\n95 90 89 96 80\n```\n**Sample Output 0**\n```\n355\n```\n\n**Explaination**\nOutput should be 90 + 89 + 96 + 80 (players 2, 3, 4, 5) as they don\'t have conflict among them (between any 2 player among them) but someone in the team has conflict with the 1st player.\n\n\n\n

Question\nGiven a list of n players, select a team with maximum score and no conflicts. Conflicts arise when a younger player has more score than elder player.\