Hackerrank - Luck Balance Solution
2 min read

Hackerrank - Luck Balance Solution

Hackerrank - Luck Balance Solution

Lena is preparing for an important coding competition that is preceded by a number of sequential preliminary contests. Initially, her luck balance is 0. She believes in "saving luck", and wants to check her theory. Each contest is described by two integers,  and :

  • is the amount of luck associated with a contest. If Lena wins the contest, her luck balance will decrease by ; if she loses it, her luck balance will increase by .
  • denotes the contest's importance rating. It's equal to  if the contest is important, and it's equal to  if it's unimportant.

If Lena loses no more than  important contests, what is the maximum amount of luck she can have after competing in all the preliminary contests? This value may be negative.

For example,  and:Contest L[i] T[i]1 5 12 1 13 4 0

If Lena loses all of the contests, her will be . Since she is allowed to lose  important contests, and there are only  important contests. She can lose all three contests to maximize her luck at . If , she has to win at least  of the  important contests. She would choose to win the lowest value important contest worth . Her final luck will be .

Function Description

Complete the luckBalance function in the editor below. It should return an integer that represents the maximum luck balance achievable.

luckBalance has the following parameter(s):

  • k: the number of important contests Lena can lose
  • contests: a 2D array of integers where each  contains two integers that represent the luck balance and importance of the  contest.

Input Format

The first line contains two space-separated integers  and , the number of preliminary contests and the maximum number of important contests Lena can lose.
Each of the next  lines contains two space-separated integers,  and , the contest's luck balance and its importance rating.


Output Format

Print a single integer denoting the maximum amount of luck Lena can have after all the contests.

Sample Input

6 3
5 1
2 1
1 1
8 1
10 0
5 0

Sample Output



There are  contests. Of these contests,  are important and she cannot lose more than  of them. Lena maximizes her luck if she wins the  important contest (where ) and loses all of the other five contests for a total luck balance of .

Solution in Python

def luckBalance(k, contests):
    important, optional = [], 0
    for x,y in contests:
        if y: 
    if k<len(important):
        s = sorted(important)
        i = len(s)-k
        return optional+sum(s[i:])-sum(s[:i])
    return optional+sum(important)

n,k = map(int,input().split())
contests = [list(map(int,input().split())) for _ in range(n)]
print(luckBalance(k, contests))

Enjoying these posts? Subscribe for more

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.