C++ Problem The game starts out with n leprechauns. Each leprechaun starts out with a million…

C++ Problem
The game starts out with n leprechauns. Each leprechaun
starts out with a million dollars of gold (i.e.,
gi = 1,000,000). The player wants to trap as many
of these leprechauns in a pit and steal their gold! The leprechauns
are all in a row, with each leprechaun at location
xi, a double precision floating point number.
Initially, the first leprechaun is at x=0, the second at
x=1,000,000, …; i.e., xi =
i*gi, i=0,1,2,….

At every iteration of the simulation, the leprechauns are processed
in strict order from i=0,1,2,… The processing of a
leprechaun involves these steps:
The leprechaun jumps to a new location xi +
r * gi, where r is a random number
between -1 and 1.
There is a pit located between -1,000 and 1,000. If -1000 < xi < 1000, then that leprechaun is trapped forever (does not participate in the game anymore) and all his gold is added to the players score (the player starts with score=0). If a leprechaun lands right on top of another (k), then the newly arrived leprechaun steals all the gold from k, and the bankrupt leprechaun k exits the game. The leprechaun then steals half the gold from the nearest leprechauns to his right and left, if he indeed has both neighbours. (If the position moved to is either the largest or smallest value of all xi, then there is only one neighbour that is nearest. In this case he steals half the gold from this nearest neighbour). The game ends after a fixed period of time (e.g., 20 seconds), at which point the final score is displayed. You must use a map-based data structure for this project to efficiently access and modify the state of the leprechauns. While it is possible to implement the logic using simpler data structures, your code will run too slow to be competitive. Note that the more iterations you can complete within the specified time limit, the more likely you are to trap leprechauns and get a higher score. You can use the map container included in the C++ Library HERE IS THE SAMPLE CODE THAT MUST BE USED, DO NOT CHANGE ANYTHING JUST ADD TO IT: #include "stdafx.h" #include