title: Sorting People into Groups based on Votes
body: <p>I have a problem with finding a algorithm for sorting a dataset of people. I try to explain as detailed as possible:</p>
  
  <p>The story starts with a survey. A bunch of people, lets say 600 can choose between 20-25 projects. They make a #1-wish, #2-wish and #3-wish, where #1 is the most wanted project they want to take part and wish 3 the "not-perfect-but-most-acceptable-choose". </p>
  
  <p>These project are limited in their number of participants. Every project can join around 30 people (based on the number of people and count of projects).</p>
  
  <p>The algorithm puts the people in the different projects and should find the best possible combination. </p>
  
  <p>The problem is that you can't just put all the people with their number 1 wish X in the certain project and stuff all the other with also number 1 wish X in there number 2 wish because that would not be the most "happiest" situation for everybody.</p>
  
  <p>You may can think of what I mean when you imagine that for everybody who get his number 1 wish you get 100 points, for everybody who get his number 2 wish 60 points, number 3 wish 30 points and who get not in one of his wishes 0 points. And you want to get as most points as possible.</p>
  
  <p>I hope you get my problem. This is for a school-project day.
  Is there something out there that could help me? Do you have any idea? I would be thankful for every tipp!!</p>
  
  <p>Kind regards</p>