STL：deque打分案例

#include <iostream>
#include <deque>
#include <vector>
#include <algorithm>
using namespace std;

class Player {
	friend void Create_Player(vector<Player>& player);
public:
	Player() {}
	Player(double score,string name):score(score),name(name) {}
	string name;
	double score;
};
//创建选手
void Create_Player(vector<Player>& player) {
	string s = "ABCDE";
	for (int i = 0; i < 5; i++) {
		Player p;
		p.name = s[i];
		p.score = 0;
		player.push_back(p);
	}
}
//打分
void PrintScore(double v ) {
	cout << v <<" ";
}
void Play_Score(vector<Player>& player) {
	for (vector<Player>::iterator it = player.begin(); it != player.end();it++) {
		deque<double> dq;
		double mean = 0;
		for (int j = 0; j < 10; j++) {
			dq.push_back(rand() % 41 + 60);
		}
		sort(dq.begin(), dq.end());
		
		//cout << "选手分数:" << endl;
		//for_each(dq.begin(), dq.end(), PrintScore);
		//cout << endl;
		//cout << "去掉最高最低分:" << endl;
		dq.pop_back();
		dq.pop_front();
		//for_each(dq.begin(), dq.end(), PrintScore);
		//cout << endl;
		//最终平均分
		for (deque<double>::iterator it = dq.begin(); it != dq.end(); it++) {
			mean += *it;
		}
		mean /= dq.size();
		(*it).score = mean;
	}
	
	for (Player v : player) {
		cout << "name:" << v.name << " score:" << v.score << endl;
	}
}
//排序规则
bool mycompare(Player& p1, Player p2) {
	return p1.score > p2.score;
}
//排序
void Play_Rank(vector<Player>& player) {
	cout << "由大到小排序" << endl;
	//排序
	sort(player.begin(), player.end(),mycompare);//这里要注意
	for (Player v : player) {
		cout << "name:" << v.name << " score:" << v.score << endl;
	}
}

int main() {
	vector<Player> player;
	Create_Player(player);
	Play_Score(player);
	Play_Rank(player);
}