paste bin

#include <cstdio>
#include <algorithm>
using std::sort;
struct member 
{
    int index;
    int time;
    bool operator<(const member &b)const
    {
        if (time!=b.time)   
            return time<b.time;
        else                
            return index<b.index;
    }
};

int main(void)
{
	int N,i,t1,t2;
    member *a;
    scanf("%d",&N);
    a=new member [N];
    for(i=0;i<N;i++)
    {
        scanf("%d%d",&t1,&t2);
        a[i].time=t1+t2;
        a[i].index=i+1;
    }
    sort(a,a+N);

    for(i=0;i<N;i++)
    {
        if(i>0)
            printf(" ");
        printf("%d",a[i].index);
    }
    printf("\n");
	return 0;
}