Hackerrank - Greedy - Jim and the Orders

By -
Jim's Burgers has n hungry burger fans waiting in line. Each unique order,i, is placed by a customer at time ti, and the order takes di units of time to process.


Given the information for all n orders, can you find and print the order in which all n customers will receive their burgers? If two or more orders are fulfilled at the exact same time t, sort them by ascending order number.

Sample Input 0
3
1 3
2 3
3 3
Sample Output 0
1 2 3
Sample Input 1
5
8 1
4 2
5 6
3 1
4 3
Sample Output 1
4 2 5 1 3





Solution


itt = int(raw_input())
dict = {}
for k in range(1,itt+1):
    dict[k] = sum(map(int, raw_input().split()))
    
new_dict = sorted(dict, key=dict.get)
print " ".join(map(str,new_dict))






















































Comments











Post a Comment



















Best Programming language for machine learning.











Popular posts from this blog









Hackerrank - Dynamic Programming - The Coin Change Problem







By







-















      You have   types of coins available in infinite quantities where the value of each coin is given in the array  . Can you determine the number of ways of making change for   units using the given types of coins? For example, if  , and  , we can make change for   units in three ways:  ,  , and  .   Given  ,  , and  , print the number of ways to make change for   units using any number of coins having the values given in  .        Input Format      The first line contains two space-separated integers describing the respective values of   and  .  The second line contains   space-separated integers describing the respective values of   (the list of distinct coins available in infinite amounts).        Constraints         Each   is guaranteed to be distinct.    Hints   Solve overlapping subproblems using  Dynamic Programming  (DP):   You can solve this problem recursively but will not pass all the test cases without optimizing to eliminate the  overlapping subproblems . Think of a way 








Read more










Hackerrank - Implementation - Picking Numbers







By







-















     Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is  .        Input Format      The first line contains a single integer,  , denoting the size of the array.  The second line contains   space-separated integers describing the respective values of  .        Constraints        The answer will be  .         Output Format      A single integer denoting the maximum number of integers you can choose from the array such that the absolute difference between any two of the chosen integers is  .        Sample Input 0      6  4 6 5 3 3 1          Sample Output 0      3          Explanation 0      We choose the following multiset of integers from the array:  . Each pair in the multiset has an absolute difference   (i.e.,   and  ), so we print the number of chosen integers,  , as our answer.        Sample Input 1      6  1 2 2 3 1 2          Sample Output 1      5     








Read more