C++ sort 对结构体进行排序

在C++中，对自定义的结构体进行排序，需要自定义一个称为比较器的函数（下面代码中的comparison函数）

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

struct Point {
    int x;
    int y;
    Point(int x, int y) : x(x), y(y) {}
};

//comparison函数不能写在类Solution内部
//如果希望升序排序就是"<",如果希望是降序排列，就是">"
bool comparison(Point a, Point b) {
    return a.x < b.x;
}

class Solution {
public:
    vector<Point> mySort(vector<Point>& points) {
        sort(points.begin(), points.end(), comparison);
        return points;
    }
};
int main()
{
    while (true) {
        Solution solution;
        vector<Point> points;
        int count;
        cin >> count;
        for (int i = 0; i < count; i++) {
            int x, y;
            cin >> x >> y;
            Point p(x, y);
            points.push_back(p);
        }
        vector<Point> result = solution.mySort(points);
        for (int i = 0; i < result.size(); i++) {
            cout << "(" << result[i].x << ", " << result[i].y << ") ";
        }
        cout << endl;
    }

    return 0;
}