HDU1084（快速排序）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1084

应用系统自带的排序就可以轻松解决~~

代码如下：

#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;

typedef struct
{
      int solve;
      int score;
      int time;
      int order;        
} data;

data s[101];

int cmp_1(const void *c, const void *d)
{
      data *a = (data *)c;
      data *b = (data *)d;
      if(a->solve != b->solve)
      {
            return a->solve - b->solve;           
      }    
      if(a->solve == b->solve && a->time != b->time)
      {
            return a->time - b->time;           
      }
      return 0;
}

int cmp_2(const void *c, const void *d)
{
      data *a = (data *)c;
      data *b = (data *)d;
      return a->order - b->order;    
}

int main()
{
    int n;
    int a, b, c;
    int num[6];
    while(scanf("%d", &n) != EOF && n >= 0)
    {
          memset(num, 0, sizeof(num));
          for(int i = 0; i < n; i++)
          {
               scanf("%d %d:%d:%d", &s[i].solve, &a, &b, &c);
               s[i].time = a * 3600 + b * 60 + c;
               s[i].order = i;
               num[s[i].solve]++;
               if(s[i].solve == 0)
               {
                      s[i].score = 50;              
               }
               else
               {
                      s[i].score = 50 + s[i].solve * 10;    
               }
          }  
          qsort(s, n, sizeof(s[0]), cmp_1); 
          for(int i = 4; i >= 1; i--) 
          {
                  if(num[i] != 0)
                  {
                         int j;
                         int temp = num[i] / 2;
                         for(j = 0; j < n; j++)
                         {
                               if(s[j].solve == i)
                               {
                                      break;              
                               }      
                         }                
                         for(int k = 0; k < temp; k++)
                         {
                                 s[j++].score += 5;        
                         } 
                  }        
          }   
          qsort(s, n, sizeof(data), cmp_2);
          //printf("\n"); 
          for(int i = 0; i < n; i++)
          {
                 printf("%d\n", s[i].score);        
          } 
          printf("\n");         
    }
    return 0;    
}