方法一:结构体+compare+sort
#include <algorithm>
#include <iostream>
using namespace std;
typedef struct student{//用结构体存储结果
string name;
int grade;
}Student;
//排序算法使用compare+sort
bool compare0(Student a,Student b)//降序
{
return a.grade>b.grade;
}
bool compare1(Student a, Student b)//升序
{
return a.grade<b.grade;
}
//falg==0降序
//flag==1升序
int main() {
int n,flag;
cin>>n>>flag;
Student stu[n];
for(int i=0;i<n;i++)
{
cin>>stu[i].name>>stu[i].grade;
}
if(flag==1){
stable_sort(stu,stu+n,compare1);
}
else {
stable_sort(stu, stu+n, compare0);
}
for(int i=0;i<n;i++)//打印成绩单
{
cout<<stu[i].name<<" "<<stu[i].grade<<endl;
}
}
方法2:map已经自带了排序
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
int flag;//falg为0 从高到低
while (cin >> n >> flag) {
map<int, vector<string>> mp;
string name;
int score;
for(int i = 0; i < n; i++){//建立成绩和名字的映射
cin >> name;
cin >> score;
mp[score].push_back(name);
}
if (flag == 0) {//从高到低
for (auto it = mp.rbegin(); it != mp.rend(); ++it) {//逆序遍历
for (int i = 0; i < it->second.size(); i++) {//成绩相同时,按照输入顺序输出
cout << it->second[i] << " " << it->first << endl;
}
}
} else {//flag==1从低到高
for (auto it = mp.begin(); it != mp.end(); ++it) {//顺序遍历
for (int i = 0; i < it->second.size(); i++) {//成绩相同时,按照输入顺序输出
cout << it->second[i] << " " << it->first << endl;
}
}
}
}
return 0;
}
方法3:pair
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
bool compare0(pair<string,int>a,pair<string,int>b)//flag==0,从高到低排列,即降序排列
{
return a.second>b.second;
}
bool compare1(pair<string,int>a,pair<string,int>b)//flag==1从低到高排列,即升序排列
{
return a.second<b.second;
}
int main() {
int n;cin>>n;
int flag;cin>>flag;
vector<pair<string,int>>vec;
for(int i=0;i<n;i++)
{
string name;cin>>name;
int score;cin>>score;
vec.push_back(make_pair(name,score));
}
if(flag==0) stable_sort(vec.begin(), vec.end(), compare0);
else stable_sort(vec.begin(), vec.end(), compare1);
for(auto it=vec.begin();it!=vec.end();it++)//it是迭代器
{
cout<<(*it).first<<" "<<(*it).second<<endl;
}
return 0;
}
其中,
for(auto it=vec.begin();it!=vec.end();it++)
{
cout<<(*it).first<<' '<<(*it).second<<endl;
}
等价于下面的写法
vector<pair<string,int>> ::iterator it;
for(it = vec.begin(); it != vec.end(); it++)
{
cout<<(*it).first<<' '<<(*it).second<<endl;
}