Gold Distribution

A group of pirates each have a distribution of gold coins, which can be represented as an array:

[3, 9, 4, 5, 5]
// Pirate 1 has 3 gold, Pirate 2 has 9 gold, etc.

The difference between each pirate's share of gold and that of the richest pirate is represented as:

[6, 0, 5, 4, 4]
// Since 6 = 9 - 3, 0 = 9 - 9, 4 = 9 - 5, etc.

Pirates have a keen sense of fairness, and a pirate will kill the others if he deems his share to be too little. Each pirate has a unique inequality threshold - the maximum difference he is willing to tolerate before he kills his comrades.

Using the above gold distribution:

[5, 0, 5, 5, 5]
// Pirates killed, since 5 < 6.
// 5 is Pirate 1's inequality distribution and 6 is his gold difference.

[7, 0, 5, 5, 5]
// Pirate 1 is satisfied, since 7 > 6.
// All other pirates are satisfied as well.

Given a distribution of coins and an array of inequality thresholds, create a function that returns true if any pirates are killed, or false otherwise.

Examples

piratesKilled([3, 5, 8, 3, 4], [10, 4, 2, 5, 5]) ➞ false

piratesKilled([3, 5, 8, 3, 4], [10, 4, 2, 5, 1]) ➞ true

piratesKilled([3, 3, 10], [7, 7, 0]) ➞ false

piratesKilled([3, 3, 10], [6, 6, 0]) ➞ true

Notes

• A pirate kills if the difference in his share of gold from the richest pirate is strictly greater than his inequality threshold.
• Gold and inequality distribution arrays are both ordered the same. (e.g. Pirate 1 is index 0 for both arrays, Pirate 2 is index 1 for both arrays, etc).