[题解]UVA10026 Shoemaker's Problem

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 #define MaxN 1020
 7 struct node
 8 {
 9     int Time,Fine,Num;
10 }Shoe[MaxN];
11 int T,n;
12 inline void Get_int(int &Ret)
13 {
14     char ch;
15     bool flag=false;
16     for(;ch=getchar(),ch<‘0‘||ch>‘9‘;)
17         if(ch==‘-‘)
18             flag=true;
19     for(Ret=ch-‘0‘;ch=getchar(),ch>=‘0‘&&ch<=‘9‘;Ret=Ret*10+ch-‘0‘);
20     flag&&(Ret=-Ret);
21 }
22 bool Cmp(node a,node b)
23 {
24     return a.Fine*b.Time > a.Time*b.Fine;
25 }
26 int main()
27 {
28     Get_int(T);
29     int i;
30     while(T--)
31     {
32         Get_int(n);
33         for(i=1;i<=n;++i)
34         {
35             Get_int(Shoe[i].Time);
36             Get_int(Shoe[i].Fine);
37             Shoe[i].Num=i;
38         }
39         sort(Shoe+1,Shoe+1+n,Cmp);
40         for(i=1;i<n;++i)
41             printf("%d ",Shoe[i].Num);
42         printf("%d\n",Shoe[n].Num);
43         if(T)
44             printf("\n");
45     }
46     return 0;
47 }