for those who got problem (simple method using multimap)

int main() {

    multimap<int,int> m;
    int n;cin>>n;
    for(int i=1;i<=n;i++)
    {
    int a,b; cin>>a>>b;
    m.insert(make_pair(a+b,i));
    }   

   for(multimap<int,int >::iterator me=m.begin();me!=m.end();me++ )
    {cout<<me->second<<" ";
            }        
return 0;

}

getting same output as defined in test case 7 on my local pc it fails in hacker rank kindly help....

How does this problem come under "greedy" paradigm?

def jimOrders(orders): serve_time = []

for i, v in enumerate(orders):
    serve_time.append([v[0]+v[1],i+1])

serve_time.sort()
order = [x[1] for x in serve_time]
return order

my solution in python 3, pretty simple

Crazy 1-liner in Python3. :D

print(*(lambda s: sorted(range(1, len(s) + 1), key=lambda i: s[i - 1]))(tuple(sum(map(int, input().split())) for _ in range(int(input())))))