SP14049 VOLNTEER - Annual Day

### Problem Statement The kids at DACT elementary school are very excited since they have their annual day coming up. On this occasion, the students get a chance to display all their projects and art work, as well as perform on stage for all the parents and other guests who will be coming. Since organizing an event so big requires a lot of effort, the poor teachers alone cannot handle it all. So, they decide to ask some of the students to volunteer to lend a hand. You are the class teacher of one such kindergarten class with N students, and you need to select exactly k of your students for the volunteer group. Luckily for you, all the kids are very enthusiastic and excited and everyone wants to help out ! But you also know that many of these students are very naughty and may start playing with each other halfway through instead of doing work. So you want to select this group of students in a smart manner to avoid such a scenario. Since you have been their class teacher for nearly a year, you know beforehand how naughty each kid is, and have assigned "goodness" scores to each of the students accordingly. The higher the score for a student, the less naughty he/she is. You can also use this individual goodness score to calculate the score for a group of students as follows : **Goodness( a $ _{1} $ , a $ _{2} $ .... a $ _{n} $ ) = ( |a $ _{1} $ |+|a $ _{2} $ |....|a $ _{n} $ | ) \* (-1) $ ^{r} $** Where a $ _{1} $ , a $ _{2} $ ... an are the goodness scores of the n students in that group, and r is the number of naughty students in that group. ( **Note** : **A naughty student is one with a negative goodness score** ) Also |x| refers to the absolute value of x. ( |x|=x if x>0. Else |x|=-x). Given the goodness scores of all the students in your class, it is up to you to select exactly k students such that their group goodness score is maximum. ### Input The first line contains 2 space separated integers N and k. ( 1

N/A

N/A