模拟,字符串,排序,STL
#include <iostream>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
const int MAXN = 10010;
int n, m;
struct Student {
string str;
int score;
int level, pos, date, id;
} stu[MAXN];
struct Position {
int pos, cnt;
};
vector<Student> v_level[3];
unordered_map<int, vector<Student> > mp_pos;
unordered_map<int, vector<Student> > mp_date;
bool cmp(Student a, Student b) {
if (a.score != b.score) return a.score > b.score;
return a.str < b.str;
}
bool cmp_pos(Position a, Position b) {
if (a.cnt != b