较大数据玩家排行榜

    有个需求是需要对我们现在新项目的所有玩家进行排行，形成所有玩家的名词排行。要求所有获得排名积分的玩家都需要进行排行，同时需要获取玩家排名时速度较快。

    思路：数据库目前注册玩家数量在17万，假设日活玩家可以做到10万，需要对10万人进行全部排行。所有人统一使用快排，不理想，因为游戏分数极其容易发生变化。所以使用map进行分段排行。

总体思路如上图，按照分数稀释一下人数，每个分数按照时间戳的间隔，比如设置十秒钟，二十秒钟为一个档位，每个档位中存放所有该分数的玩家。另外需要再维护一个map，用于存放每个分数的玩家数量。经过两个稀释，10万玩家在理想状态下可以稀释到1千，访问速度可以接受。

代码：

#ifndef _NEWSORT_H_
#define _NEWSORT_H_

#include <map>
#include <vector>
#include <set>
#include <time.h>
#include <iostream>
using namespace std;
#define uint unsigned int
#define MAX_TIME_SPACE 5  //mapSort时间间隔

enum
{
	INSERT_SUCC = 1,
	INSERT_FAIL,
	DEL_SUCC,
	DEL_FAIL,
	SORT_SUCC = 5,
	SORT_FAIL,
};
/*
*\brief sort
*/
class zNewSort
{
public:
	zNewSort(){}
	/*uint getRankSegByScore(uint uiScore = 0)
	{
		uint uiPos = (uint)veRankSeg.size() - 1;
		while(uiPos > 0)
		{
			if (uiScore >= veRankSeg[uiPos])
				return veRankSeg[uiPos];
			uiPos--;
		}
		return veRankSeg[0];
	}*/
	void showLog(uint uiRole, uint uiHandle, uint uiScore = 0)
	{
		switch (uiHandle)
		{
		case INSERT_SUCC:  //insert success
			cout << "insert success,roleid:" << uiRole << " ,time:" << getNowTime() <<" ,score:"<<uiScore << endl;
			break;
		case INSERT_FAIL:  //insert fail
			cout << "insert fail,roleid:" << uiRole << " ,time:" << getNowTime() << " ,score:" << uiScore << endl;
			break;
		case DEL_SUCC:  //del success
			cout << "del success,roleid:" << uiRole << " ,time:" << getNowTime() << " ,score:" << uiScore << endl;
			break;
		case DEL_FAIL:  //del fail
			cout << "del fail,roleid:" << uiRole << " ,time:" << getNowTime() << " ,score:" << uiScore << endl;
			break;
		case SORT_SUCC:
			cout << "getsortnum succ,roleid:" << uiRole << " ,time:" << getNowTime() << " ,num:" << uiScore << endl;
			break;
		case SORT_FAIL:
			cout << "getsortnum fail,roleid:" << uiRole << " ,time:" << getNowTime() << " ,num:" << uiScore << endl;
			break;
		default:
			break;
		}
	}
	uint getNowTime()
	{
		time_t tmp;
		time(&tmp);
		return (uint)tmp;
	}
	void insertSortList(uint uiRoleid, uint uiScore)
	{
		auto it = m_mapSort.find(uiScore);
		if (it == m_mapSort.end())
		{
			std::map<uint, std::multiset<uint>> mapTmp;
			std::multiset<uint> setTmp;
			setTmp.insert(uiRoleid);
			mapTmp.insert(std::make_pair(getNowTime(), setTmp));
			m_mapSort.insert(std::make_pair(uiScore, mapTmp));
		}
		else
		{
			uint uiTime = getNowTime();
			//uiNowUseTime用于标记当前使用时间
			auto itsecond = it->second.find(uiNowUseTime-uiTime > MAX_TIME_SPACE ? uiTime : uiNowUseTime);
			if (itsecond == it->second.end())
			{
				std::multiset<uint> setTmp;
				setTmp.insert(uiRoleid);
				it->second.insert(std::make_pair(uiTime, setTmp));
				uiNowUseTime = uiTime;
			}
			else
			{
				itsecond->second.insert(uiRoleid);
			}
		}
		addSortNum(uiScore);
		showLog(uiRoleid, INSERT_SUCC, uiScore);
	}
	void delSortList(uint uiRoleid, uint uiScore)
	{
		auto it = m_mapSort.find(uiScore);
		if (it == m_mapSort.end())
		{
			showLog(uiRoleid, DEL_FAIL, uiScore);
			return;
		}
		for (auto itsecond = it->second.begin(); itsecond != it->second.end(); ++itsecond)
		{
			auto ituser = itsecond->second.find(uiRoleid);
			if (ituser == itsecond->second.end())
			{
				continue;
			}
			itsecond->second.erase(ituser);
			if (itsecond->second.empty())
			{
				it->second.erase(itsecond);
			}
			break;
		}
		delSortNum(uiScore);
		showLog(uiRoleid, DEL_SUCC, uiScore);
	}
	uint getSortNum(uint uiRoleid, uint uiScore)
	{
		uint uiSortNum = 0;
		auto it = m_mapSort.rbegin();
		for (; it != m_mapSort.rend(); ++it)   //遍历大段位累加排名
		{
			auto itnum = m_mapSortNum.find(it->first);
			if (itnum == m_mapSortNum.end())
			{
				continue;
			}
			if (uiScore == it->first)
				break;
			uiSortNum += itnum->second;
		}
		if (it == m_mapSort.rend())
		{
			for (auto &ittmp : m_mapSortNum)
			{
				cout << "---first:" << ittmp.first << "--second:" << ittmp.second << endl;
			}
			showLog(uiRoleid, SORT_FAIL, 0);
			return 0;
		}
		auto ittime = it->second.begin();
		for (; ittime != it->second.end(); ++ittime)  //小段位查找
		{
			auto ittmp = ittime->second.find(uiRoleid);
			if (ittmp == ittime->second.end())
			{
				uiSortNum += (uint)ittime->second.size();
				continue;
			}
			for (auto ituser = ittime->second.begin(); ituser != ittime->second.end(); ++ituser)
			{
				if (uiRoleid == *ituser)
					break;
				uiSortNum += 1;
			}
			break;
		}
		return ++uiSortNum;
	}
	void addSortNum(uint uiScore)
	{
		auto it = m_mapSortNum.find(uiScore);
		if (it == m_mapSortNum.end())
		{
			m_mapSortNum.insert(std::make_pair(uiScore,1));
		}
		else
		{
			it->second++;
		}
	}
	void delSortNum(uint uiScore)
	{
		auto it = m_mapSortNum.find(uiScore);
		if (it != m_mapSortNum.end())
		{
			it->second--;
			if (0 == it->second)
				m_mapSortNum.erase(it);
		}
	}
	//展示两个map信息
	void showMapInfo()
	{
		for (auto it = m_mapSortNum.begin(); it != m_mapSortNum.end(); ++it)
		{
			cout << "score:" << it->first << " num:" << it->second << endl;
		}
		cout << "--------------------------" << endl;
		for (auto it = m_mapSort.begin(); it != m_mapSort.end(); ++it)
		{
			cout << "score:" << it->first << " size:" << it->second.size() << endl;
		}
	}
private:
	//<score, <time, set<id>>>    time保存一段时间,multimap保存id
	std::map<uint, std::map<uint, std::multiset<uint>>> m_mapSort;
	//<score, num>
	std::map<uint, uint> m_mapSortNum;
	//map中存放的时间
	uint uiNowUseTime = 0;
};

#endif // !_NEWSORT_H_

测试文件：

#include "newSort.h"
#include <iostream>
using namespace std;
int main()
{
	zNewSort sort;
	for (int i = 5; i < 10000; ++i)
	{
		//if (i % 10000 == 0)
			//_sleep(1000);
		sort.insertSortList(i, i%100+1);
	}
	cout << sort.getSortNum(9985, 86) << endl;
	cout << sort.getSortNum(9885, 86) << endl;
	cout << sort.getSortNum(85, 86) << endl;
	sort.showMapInfo();
	return 0;
}