Problem J3: Deal or No Deal Calculator

Deal or No Deal™ is a game show on NBC. You can click here to play it.

In the CCC version of the game, there are 10 possible dollar amounts: \$100, \$500, \$1,000, \$5,000, \$10,000, \$25,000, \$50,000, \$100,000, \$500,000, \$1,000,000 sealed in imaginary briefcases. These dollar amounts are numbered 1 – 10 (i.e. 1 → \$100, 2 → \$500, 3 → \$1,000, ..., 10 → \$1,000,000). Before the game starts the contestant will have chosen one of the briefcases as his/hers to possibly keep. During the game, some of the ten possible dollar amounts have been eliminated from the game because the contestant has selected some of the other briefcases and revealed the amounts inside.

At some point, the contestant will stop opening briefcases, and a “Banker” will offer the contestant cash in exchange for what might be contained in his/her chosen briefcase. Then the contestant is asked: “Deal or No Deal?”.

Write a program that helps a player decide if he/she should choose “deal” or “no deal”, by calculating the average of the remaining amounts (i.e., all unopened briefcases, including his/her “own” briefcase), and comparing that value to the “Banker’s” offer. If the offer is higher than the average, then the player should ”deal” otherwise, the player should say “no deal”.

Input

The user must input a number n (1 ≤ n < 10) which indicates how many cases have been opened so far, followed by a list of integers between 1 and 10 representing the values in the game that have been eliminated, followed by the “Banker’s” offer. For example: `3 2 5 10 300` indicates that briefcases containing \$500, \$10,000, and \$1,000,000 have been eliminated and the Banker’s offer is \$300. You may assume that no duplicate case numbers are entered for the eliminated values, and you may assume that the “Banker’s” offer is an integer greater than 10.

Output

The program will print out one of two statements: “deal” or “no deal”.

Sample Input 1

```2 3 8 198000```

Sample Output 1

`no deal`

Sample Input 2

```8 10 9 8 7 6 5 4 3 400```

Sample Output 2

`deal`

Point Value: 3
Time Limit: 2.00s
Memory Limit: 16M

Problem Types: [Show]

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3