Сортировка точек

#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
    struct Point {
        int x, y;
        bool operator< (const Point &p) {
            return this->x*this->x + this->y*this->y < p.x*p.x + p.y*p.y;
        }
    };
    vector<Point> mas;
 
    ifstream cin("input.txt");
    ofstream cout("output.txt");
 
    int n;
    cin >> n;
    mas.resize(n);
    for(int i = 0; i < n; ++i) {
        cin >> mas[i].x;
        cin >> mas[i].y;
    }
    sort(mas.begin(), mas.end());
    for(int i = 0; i < n; ++i) {
        cout << mas[i].x << ' ' << mas[i].y << endl;
    }
    return 0;
}

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
struct point_t
{
    double x_, y_;
};
 
double distance_(const point_t &point)
{
    return sqrtf(point.x_*point.x_ + point.y_*point.y_);
}
 
 
int main()
{
    vector<point_t>  source_;
    int N = 0;
    double x_ = 0, y_ = 0;
    cin >> N;
    for (int i = 0; i < N; ++i)
    {
        cin >> x_ >> y_;
        source_.push_back(point_t{ x_, y_ });
    }
    sort(source_.begin(), source_.end(), [](point_t lhs, point_t rhs) {return distance_(lhs) < distance_(rhs); });
    for (point_t & point_ : source_)
    {
        cout << "point with x =" << point_.x_ << " y = " << point_.y_ << endl;
    }
    return 0;
}

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct point_t;
 
double distance_(const point_t &point);
 
struct point_t
{
    double x_, y_;
    bool operator<(const point_t &p) {
        return distance_(*this) < distance_(p);
    }
};
 
double distance_(const point_t &point)
{
    return point.x_*point.x_ + point.y_*point.y_;
}
 
 
int main()
{
    vector<point_t>  source_;
    int N = 0;
    double x_ = 0, y_ = 0;
    cin >> N;
    for (int i = 0; i < N; ++i)
    {
        cin >> x_ >> y_;
        source_.push_back(point_t{ x_, y_ });
    }
    sort(source_.begin(), source_.end());
    for (int i = 0; i < source_.size(); ++i)
    {
        cout << "point with x =" << source_[i].x_ << " y = " << source_[i].y_ << endl;
    }
    return 0;
}

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct point_t;
 
double distance_(point_t point);
 
struct point_t
{
    double x_, y_;
    bool operator<(const point_t &p) {
        return distance_(*this) < distance_(p);
    }
};
 
double distance_(point_t point)
{
    return point.x_*point.x_ + point.y_*point.y_;
}
 
 
int main()
{
    vector<point_t>  source_;
    int N = 0;
    double x_ = 0, y_ = 0;
    cin >> N;
    for (int i = 0; i < N; ++i)
    {
        cin >> x_ >> y_;
        source_.push_back(point_t{ x_, y_ });
    }
    sort(source_.begin(), source_.end());
    for (int i = 0; i < source_.size(); ++i)
    {
        cout << "point with x =" << source_[i].x_ << " y = " << source_[i].y_ << endl;
    }
    return 0;
}

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct point_t;
 
double distance_(point_t point);
 
struct point_t
{
    double x_, y_;
    bool operator<(point_t p) {
        return distance_(*this) < distance_(p);
    }
};
 
double distance_(point_t point)
{
    return point.x_*point.x_ + point.y_*point.y_;
}
 
 
int main()
{
    vector<point_t>  source_;
    int N = 0;
    double x_ = 0, y_ = 0;
    cin >> N;
    for (int i = 0; i < N; ++i)
    {
        cin >> x_ >> y_;
        source_.push_back(point_t{ x_, y_ });
    }
    sort(source_.begin(), source_.end());
    for (int i = 0; i < source_.size(); ++i)
    {
        cout << "point with x =" << source_[i].x_ << " y = " << source_[i].y_ << endl;
    }
    return 0;
}

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
 
struct point_t
{
    double x_, y_;
    bool operator<(point_t point) {
        return this->x_*this->x_ + this->y_*this->y_ < point.x_*point.x_ + point.y_*point.y_;
    }
};
 
 
 
int main()
{
    vector<point_t>  source_;
    int N = 0;
    double x_ = 0, y_ = 0;
    cin >> N;
    for (int i = 0; i < N; ++i)
    {
        cin >> x_ >> y_;
        source_.push_back(point_t{ x_, y_ });
    }
    sort(source_.begin(), source_.end());
    for (int i = 0; i < source_.size(); ++i)
    {
        cout << "point with x =" << source_[i].x_ << " y = " << source_[i].y_ << endl;
    }
    return 0;
}