Practice3_5_vector_sort_struct_gold_silver_bronze_playerName1

本例中实现了金银铜奖牌数降序排序，若两个运动员金银铜的奖牌数都相同，则按照运动员的姓名升序排序。

其中，关于结构体中的operator，这是其中一种写法；看到有同事ysf用了另外一种方法，看起来也比较清晰，下一个版本实现。

注意：这里说的两种写法，都是在结构体中使用“bool operator <(const ScoreStruct &right) const”实现的，其实也可以单独拿出来，写一个比较器函数，作为sort()函数的第三个参数。再下下个版本实现。

// Practice3_vector_sort_struct.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <ctime>
#include <stdio.h>
#include <string>

using namespace std;

struct ScoreStruct
{
    string name; 
    unsigned int gold;
    unsigned int silver;
    unsigned int bronze;
    bool operator <(const ScoreStruct &right) const
    {
        int temp = name.compare(right.name);
        if(gold != right.gold)//首先按照金银铜牌数降序，如果都相等，则按照姓名升序
        {
            return gold > right.gold;
        }
        else
        {
            if(silver != right.silver)
            {
                return silver > right.silver;
            }
            else
            {
                if(bronze != right.bronze)
                {
                    return bronze > right.bronze;
                }
                else if(temp < 0)
                {
                    return 1;
                }
            }
        }
        return 0;//无论如何，要保证最后要有一个return的
    }
};

string strs[4] = { "tencent", "google","alibaba", "facebook"};

void initVector(vector<ScoreStruct> &vec, unsigned int size)
{
    srand(unsigned(time(NULL)));
    for(unsigned int i =0; i < size; i++)
    {
        //char buff[32] = {0};
        int goldCount = rand()%100;
        int silverCount = rand()%100;
        int bronzeCount = rand()%100;
        //sprintf(buff, "%d", chineseScore);
        ScoreStruct ss = {strs[i], goldCount, silverCount, bronzeCount};
        /*
        ScoreStruct ss = {"0", 0};
        strcpy(ss.name, buff);
        ss.score = randNum;
        */
        vec.push_back(ss);
    }
}

void printVector(vector<ScoreStruct> vec)
{
    vector<ScoreStruct>::iterator it = vec.begin();
    for(; it != vec.end();++it)
    {
        cout << it->name << "," << it->gold << "," << it->silver << "," << it->bronze << " ";
    }
    cout<<endl;
}

int _tmain(int argc, _TCHAR* argv[])
{
    vector<ScoreStruct> vect;
    initVector(vect, 4);
    cout<<"before sort"<<endl;
    printVector(vect);
    sort(vect.begin(), vect.end());
    cout<<"after sort"<<endl;
    printVector(vect);
    return 0;
}

运行结果示例1（这个结果很好，恰好随机到有两名player金牌数相同，则按照银牌排序）：

before sort
tencent,93,65,21 google,93,41,86 alibaba,77,88,35 facebook,81,87,25
after sort
tencent,93,65,21 
google,93,41,86 
facebook,81,87,25 
alibaba,77,88,35

运行结果示例2（这个例子故意把金银铜数量设置为相同，结果表明很好滴实现了需求）：

before sort
tencent,6,6,6 google,6,6,6 alibaba,6,6,6 facebook,6,6,6
after sort
alibaba,6,6,6 facebook,6,6,6 google,6,6,6 tencent,6,6,6