题目1007：奥运排序问题

#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <cstdio>
using namespace std;
//#include<stdlib.h>
//#include<stdio.h>
struct cou{
    int ID, gold, prize, rank[4];
    double gold_pop, prize_pop;
};
 
bool cmp(const cou & A, const cou & B){ return A.ID < B.ID; }
bool cmp0(const cou & A, const cou & B){ return A.gold > B.gold; }
bool cmp1(const cou & A, const cou & B){ return A.prize > B.prize; }
bool cmp2(const cou & A, const cou & B){ return A.gold_pop > B.gold_pop; }
bool cmp3(const cou & A, const cou & B){ return A.prize_pop > B.prize_pop; }
 
int main()
{
    int n, m;
    while (scanf("%d%d", &n, &m) != EOF){
        vector<cou> country_temp(n), country;
        int gold, prize, pop, coun;
        for (int i = 0; i < n; ++i){
            scanf("%d%d%d", &gold, &prize, &pop);
            country_temp[i].gold = gold; country_temp[i].prize = prize;
            country_temp[i].gold_pop = (double)gold / pop; country_temp[i].prize_pop = (double)prize / pop;
        }
        for (int i = 0; i < m; ++i){
            scanf("%d", &coun);
            country.push_back(country_temp[coun]);
            country.back().ID = i;
        }
        sort(country.begin(), country.end(), cmp0);
        for (int i = 0; i < m; ++i){
            if (i > 0 && country[i].gold == country[i - 1].gold)country[i].rank[0] = country[i - 1].rank[0];
            else country[i].rank[0] = i + 1;
        }
        sort(country.begin(), country.end(), cmp1);
        for (int i = 0; i < m; ++i){
            if (i > 0 && country[i].prize == country[i - 1].prize)country[i].rank[1] = country[i - 1].rank[1];
            else country[i].rank[1] = i + 1;
        }
        sort(country.begin(), country.end(), cmp2);
        for (int i = 0; i < m; ++i){
            if (i > 0 && country[i].gold_pop == country[i - 1].gold_pop)country[i].rank[2] = country[i - 1].rank[2];
            else country[i].rank[2] = i + 1;
        }
        sort(country.begin(), country.end(), cmp3);
        for (int i = 0; i < m; ++i){
            if (i > 0 && country[i].prize_pop == country[i - 1].prize_pop)country[i].rank[3] = country[i - 1].rank[3];
            else country[i].rank[3] = i + 1;
        }
        sort(country.begin(), country.end(), cmp);
        for (int j = 0; j < m; ++j){
            int min_index = 0;
            for (int i = 1; i < 4; ++i)if (country[j].rank[i] < country[j].rank[min_index])min_index = i;
            printf("%d:%d\n", country[j].rank[min_index], min_index + 1);
        }
        printf("\n");
    }
}
/**************************************************************
    Problem: 1007
    User: cust123
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1524 kb
****************************************************************/