1 #include<iostream>
 2 #include<stdio.h>
 3 #include<string.h>
 4 #include<algorithm>
 5 using namespace std;
 6 int flag[1000005];
 7 struct node{
 8        int a;
 9        int v;
10 };
11 node p[1000005];
12 int fa[1000005];
13 bool cmp(const node & b,const node & c){
14      return b.v>c.v;
15 }
16 int sea(int start){
17     if(start==0)
18            return -1;
19     if(flag[start]==0){
20           return start;
21           }
22  //   cout<<start<<endl;
23     int tem=fa[start];
24     fa[start]=fa[fa[start]];
25     return sea(tem);
26 }
27 int main(){
28     int n,m;
29     while(scanf("%d%d",&n,&m)!=EOF){
30         memset(flag,0,sizeof(flag));
31       //  memset(flag2,0,sizeof(flag2));
32         int sum=0;
33         for(int i=0;i<n;i++){
34                 scanf("%d%d",&p[i].a,&p[i].v);
35            //     flag[i]=0;
36             //    flag2[i]=0;
37            //     fa[i+1]=i;
38          }
39          for(int k=0;k<=1000000;k++){
40                  fa[k+1]=k;
41                  }
42         sort(p,p+n,cmp);
43         for(int j=0;j<n;j++){
44                 int temp;
45                 if(p[j].a>m){
46                           temp=sea(m);
47                           }
48                 else{
49                           temp=sea(p[j].a);
50                    //       cout<<p[j].a<<" "<<temp<<endl;
51                           }
52                 if(temp!=-1){
53                           sum+=p[j].v;
54                           flag[temp]=1;
55                     //      fa[p[j].a]=temp;
56                           }
57         //        else{
58           //                flag2[temp]=1;
59             //              }
60                           }
61         printf("%d\n",sum);
62     //    cout<<sum<<endl;
63         }
64     return 0;
65 }

 1 #include<iostream>
 2 #include<stdio.h>
 3 #include<string.h>
 4 #include<algorithm>
 5 #include<map>
 6 using namespace std;
 7 struct node{
 8        char name[100];
 9        int num;
10        int flag;
11 };
12 node a[100];
13 node b[100];
14 bool cmp(const node & c,const node & d){
15      return c.num>d.num;
16 }
17 int main(){
18     int n;
19     int times=0;
20     char top[100][20];
21     int m=0;
22     map<string,int> mapp;
23     while(cin>>n){
24         memset(a,0,sizeof(a));
25         if(n==0)
26           break;
27         m++;
28         for(int i=0;i<n;i++){
29                 scanf("%s%d",a[i].name,&a[i].num);
30               //  mapp[a[i].name]=1;
31                 }
32         sort(a,a+n,cmp);
33         for(int j=0;j<5;j++){
34                 int k;
35                 for(k=0;k<times;k++){
36                         if(strcmp(a[j].name,b[k].name)==0){
37                                     if(j<b[k].num){
38                                             strcpy(top[j],"*UP*    ");
39                                         //    top[j]="*UP*    ";
40                                             }
41                                     else if(j==b[k].num){
42                                            strcpy(top[j],"*STAY*  ");
43                                          //   top[j]="*STAY*  ";
44                                             }
45                                     else if(j>b[k].num){
46                                            strcpy(top[j],"*DOWN*  ");
47                                            // top[j]="*DOWN*  ";
48                                             }
49                                     break;
50                                             }
51                                             }
52                if(k>=times){
53                     if(mapp[a[j].name]==1){
54                           strcpy(top[j],"*UP*    ");
55                           }
56                     else
57                      strcpy(top[j],"*NEW*   ");
58                   //   top[j]="*NEW*   ";
59                      }
60                      }
61         cout<<"----------------WEEK "<<m<<"----------------"<<endl;
62         for(int g=0;g<=4;g++){
63                 printf("%d.%s%s\n",(g+1),top[g],a[g].name);
64                 }
65         for(int i=0;i<n;i++){
66                    mapp[a[i].name]=1;
67                    b[i].num=i;
68                    strcpy(b[i].name,a[i].name);
69                  }
70  //       sort(b,b+times,cmp);
71         times=n;
72         }
73        return 0;
74 }
75