Problem Statement  
You have just finished your delicious Chinese food dinner with your friends, and divided up the bill. You are given the int[] meals, where each element of meals is the total amount owed by a given person. The number of elements in meals is the same as the number of people who ordered dinner. You also notice that there is totalMoney that has been placed on the table. You now need to determine, based upon the price of each person's meal, and the amount of money that has been paid, which of your friends has paid. You are to return a int[] indicating who has already paid, where the value of each element is the zerobased index of a given person. The return int[] should be sorted in ascending order. The given data will be such that exactly one unique solution is possible.  
Definition  
 
Constraints  
  meals will contain between 1 and 50 elements, inclusive.  
  Each element of meals will be between 1 and 10000, inclusive.  
  totalMoney will be between 0 and 500000, inclusive.  
  There will be exactly one unique solution to the problem.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
