【HDOJ】3789 奥运排序问题

写了个函数指针，这题目很水，但是佷烦。

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

 #define MAXN 305

 typedef struct {
     int id, g, j;
     float gp, jp;
 } count_st;

 typedef struct {
     int r, id;
 } rank_st;

 count_st counts[MAXN], buf[MAXN];
 rank_st rank[][MAXN];
 int ids[MAXN];
 int n, m;

 int compg(const void *a, const void *b) {
     return ((count_st *)b)->g - ((count_st *)a)->g;
 }

 int compj(const void *a, const void *b) {
     return ((count_st *)b)->j - ((count_st *)a)->j;
 }

 int compgp(const void *a, const void *b) {
     return ((count_st *)b)->gp>((count_st *)a)->gp ? :-;
 }

 int compjp(const void *a, const void *b) {
     return ((count_st *)b)->jp>((count_st *)a)->jp ? :-;
 }

 void f(rank_st *a, int sel, int (*cmp)(const void*, const void *)) {
     int i, j;
     qsort(counts, m, sizeof(count_st), cmp);
     for (i=, j=; i<m; ++i) {
         if (sel == )
             if (i && counts[i].g != counts[i-].g)
                 j = i;
         if (sel == )
             if (i && counts[i].j != counts[i-].j)
                 j = i;
         if (sel == )
             if (i && counts[i].gp != counts[i-].gp)
                 j = i;
         if (sel == )
             if (i && counts[i].jp != counts[i-].jp)
                 j = i;
         (a+i)->id = counts[i].id;
         (a+i)->r = j;
     }
 }

 int main() {
     int i, j, k, v, min;
     float dp;

     while (scanf("%d %d",&n,&m) != EOF) {
         for (i=; i<n; ++i) {
             buf[i].id = i;
             scanf("%d %d %f", &buf[i].g, &buf[i].j, &dp);
             buf[i].gp = buf[i].g / dp;
             buf[i].jp = buf[i].j / dp;
         }
         for (i=; i<m; ++i) {
             scanf("%d", &j);
             counts[i] = buf[j];
             ids[i] = j;
         }
         f(rank[], , &compg);
         f(rank[], , &compj);
         f(rank[], , &compgp);
         f(rank[], , &compjp);
         for (i=; i<m; ++i) {
             min = MAXN;
             for (j=; j<; ++j) {
                 for (k=; k<m; ++k) {
                     if (rank[j][k].id == ids[i]) {
                         if (rank[j][k].r < min) {
                             v = j;
                             min = rank[j][k].r;
                         }
                         break;
                     }
                 }
             }
             printf("%d:%d\n",min+,v+);
         }
         printf("\n");
     }

     return ;
 }