C++工作笔记-map有自动排序的功能

实验如下：

代码如下：

#include <map>
#include <string>
#include <iostream>
#include <time.h>

using namespace std;


int main(){
	//学生信息映射分数

	srand((unsigned)time(NULL));
	map<int, string>mapStudent;
	for (int i = 0; i < 30; i++){
		int num_id = rand()%100 + 1;
		mapStudent.insert(pair<int, string>(num_id, "学生" + to_string(num_id)));
	}

	map<int, string>::iterator iter;
	for (iter = mapStudent.begin(); iter != mapStudent.end(); iter++)
		cout << iter->first << " " << iter->second << endl;
	cout << endl;
	getchar();
	return 0;
}