Study

Profile

Олимпиадный тренинг

Задача 38689. Point sorting


Задача

Темы: Структуры Использование сортировки Элементарная геометрия
Print all initial points in ascending order of their distances from the origin.

Create a Point structure and store the original data in an array of Point structures.

Input
The program receives a set of points on the plane as input. First, the number of points n is given, then there is a sequence of n lines, each of which contains two numbers: the coordinates of the point. The value of n does not exceed 100, all initial coordinates – integers not exceeding 103.

Imprint
It is necessary to display  all initial points in ascending order of their distances from the origin. The program displays only the coordinates of the points, there is no need to display their number.

 Examples
# Input Output
1 2
1 2
2 3 		1 2
2 3

time 1000 ms
memory 256 Mb
Правила оформления программ и список ошибок при автоматической проверке задач

Комментарий учителя

Ваш ответ

C++
Напишите программу ниже 
#include <iostream>
#include <math.h>
using namespace std;

struct Point
{
    int x;
    int y;
    double l;
};

int main() {
    Point arr[10000];
    int n, i, j, x, y, sx, sy;
    double max, sl;
    max = 0;
    cin >> n;   
  for (i = 0; i < n; i++) {
        cout << arr[i].x << " " << arr[i].y<<endl;
    }
}
     

Загруженные файлы
Нет