2023/03/03 机试学习记录

对自定义类型进行排序

思路

将类存入vector容器中，定义排序规则，用sort进行排序

代码

#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

class Student {
public:
	string s_name;
	int s_grade;
};
bool VecCompare(Student s1, Student s2) {
	return s1.s_grade < s2.s_grade;
}
int main() {
	vector<Student> vs1;
	Student s1, s2, s3, s4;
	s1.s_name = "AAA";
	s1.s_grade = 150;
	s2.s_name = "BBB";
	s2.s_grade = 250;
	s3.s_name = "CCC";
	s3.s_grade = 110;
	s4.s_name = "DDD";
	s4.s_grade = 550;
	vs1.push_back(s1);
	vs1.push_back(s2);
	vs1.push_back(s3);
	vs1.push_back(s4);
	for (size_t i = 0; i < 4; i++)
	{
		cout << vs1[i].s_name << " " << vs1[i].s_grade << endl;
	}
	cout << endl;
	for (vector<Student>::iterator vsbeg = vs1.begin();vsbeg!= vs1.end();vsbeg++)
	{
		cout << (*vsbeg).s_name << " " << (*vsbeg).s_grade << endl;
	}
	cout << endl;
	sort(vs1.begin(), vs1.end(), VecCompare);
	for (vector<Student>::iterator vsbeg = vs1.begin(); vsbeg != vs1.end(); vsbeg++)
	{
		cout << (*vsbeg).s_name << " " << (*vsbeg).s_grade << endl;
	}
	return 0;
}

两种循环都可以遍历容器

KY2 成绩排序

思路

与上题大致相同，需要自定义排序规则
用序号模拟稳定排序

#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct Student{
    char s_name[100];
    int s_grade;
    int sqe;
};
bool MyCompare0(Student s1, Student s2){
    if(s1.s_grade > s2.s_grade)
        return true;
    else if(s1.s_grade == s2.s_grade && s1.sqe < s2.sqe)
        return true;
    else 
        return false;
}
bool MyCompare1(Student s1, Student s2){
        if(s1.s_grade < s2.s_grade)
        return true;
    else if(s1.s_grade == s2.s_grade && s1.sqe < s2.sqe)
        return true;
    else 
        return false;
}
int main() {
    int count, flag, grade;
    int sqe = 0;
    char name[100];
    Student arr[1000];
    while(scanf("%d%d",&count, &flag) != EOF){
        for(int i = 0; i < count; i++){
            scanf("%s%d",arr[i].s_name,&arr[i].s_grade);
            arr[i].sqe = sqe;
            sqe++;
        }
        if(flag == 0){
            sort(arr, arr+count,MyCompare0);
        }
        if(flag == 1){
            sort(arr, arr+count,MyCompare1);
        } 
        for(int j = 0; j < count ; j++){
            printf("%s %d\n",arr[j].s_name, arr[j].s_grade);
        }
    }       
    return 0;
}

KY211 特殊排序

描述

输入一系列整数，将其中最大的数挑出(如果有多个，则挑出一个即可)，并将剩下的数进行排序，如果无剩余的数，则输出-1。

思路

将数组存入vector容器中，用sort函数进行排序，去除最后一个数，然后输出

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

int main() {
    int count;
    vector<int> v1;
    cin >> count;
    for (size_t i = 0; i < count; i++) {
        int temp;
        cin >> temp;
        v1.push_back(temp);
    }
    sort(v1.begin(), v1.end());
    cout << v1[count - 1] << endl;
    v1.erase(v1.begin() + count - 1);
    if (v1.begin()  != v1.end()) {
        for (size_t i = 0; i < count - 1; i++) {
            cout << v1[i] << " ";
        }
    } else
        cout << "-1";

    return 0;
}

KY67 整数奇偶排序

描述

输入10个整数，彼此以空格分隔。重新排序以后输出(也按空格分隔)，要求: 1.先输出其中的奇数,并按从大到小排列； 2.然后输出其中的偶数,并按从小到大排列。

思路

将数字放入第一个vector中，然后将奇数放入一个vector，偶数放入另一个vector，对这两个vector进行排序，然后依次输出

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool myCompare(int x1, int x2) {
    return x1 > x2;
}
int main() {
    vector<int> v1, v2, v3;
    for (size_t i = 0; i < 10; i++) {
        int temp;
        cin >> temp;
        v1.push_back(temp);
    }
    for (size_t i = 0; i < 10; i++) {
        if (v1[i] % 2) {
            v2.push_back(v1[i]);
        } else {
            v3.push_back(v1[i]);
        }
    }
    sort(v2.begin(), v2.end(), myCompare);
    sort(v3.begin(), v3.end());
    for (size_t i = 0; i < v2.size(); i++) {
        cout << v2[i] << " ";
    }
    for (size_t i = 0; i < v3.size(); i++) {
        cout << v3[i] << " ";
    }
    return 0;
}