#include<iostream> #include<cstring> #include<algorithm> using namespace std; struct node{ int rate,pre,no; double score; }a[3002]; bool cmp(node x,node y){ if(x.score!=y.score) return x.score>y.score; else return x.no<y.no; } int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d",&a[i].rate,&a[i].pre); a[i].score=1.0*a[i].pre*a[i].rate/100; a[i].no=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++) { printf("%d %.2lf\n",a[i].no,a[i].score); } return 0; }