Battle Royale

Problem Statement

Battle Royale Problem Description In a battle royale game, there are a total of N players and M opponents. The players' strengths are represented by an array A, while the opponents' strengths are depicted using an array B. A player successfully defeats an opponent if their strength surpasses or equals that of the opponent. Each time a player defeats a particular opponent, they earn a certain amount of coins, which is indicated by an array C with a size of M. Your task is to determine the number of coins each player can collect by defeating opponents in the game. NOTE:- The strength of the player doesn't reduce after defeating an opponent. An opponent can be defeated by multiple players. Input format The first line of input contains one integer N, denoting the size of the array PlayerPower. Next N lines contain one integer denoting the power of each player. Then input contains one integer M, denoting the size of the array OppPower. Next M lines contain one integer denoting the power of