# Print 2-D co-ordinate points in ascending order followed by their frequencies

Given two arrays **x[]** and **y[]** where **x[i]** represents the **x** coordinate and **y[i]** represents the corresponding y coordinate of a 2-D point, the task is to print the co-ordinate points in ascending order followed by their frequencies.

**Examples:**

Input:x[] = {1, 2, 1, 1, 1}, y[] = {1, 1, 3, 1, 3}

Output:

1 1 2

1 3 2

2 1 1

Input:x[] = {-1, 2, 1, -1, 2}, y[] = {-1, 1, -3, -1, 3}

Output:

-1 -1 2

1 -3 1

2 1 1

2 3 1

**Approach:** The idea is to use a map having key as pair **(x[i], y[i])** and mapped value as integer frequency of the same point. Key value will store the pair of coordinates and mapped value will store their respective frequencies.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to print the coordinates along with ` `// their frequency in ascending order ` `void` `Print(` `int` `x[], ` `int` `y[], ` `int` `n) ` `{ ` ` ` ` ` `// map to store the pairs ` ` ` `// and their frequencies ` ` ` `map<pair<` `int` `, ` `int` `>, ` `int` `> m; ` ` ` ` ` `// Store the coordinates along ` ` ` `// with their frequencies ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `m[make_pair(x[i], y[i])]++; ` ` ` ` ` `map<pair<` `int` `, ` `int` `>, ` `int` `>::iterator i; ` ` ` ` ` `for` `(i = m.begin(); i != m.end(); i++) { ` ` ` `cout << (i->first).first << ` `" "` ` ` `<< (i->first).second << ` `" "` ` ` `<< i->second << ` `"\n"` `; ` ` ` `} ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `x[] = { 1, 2, 1, 1, 1 }; ` ` ` `int` `y[] = { 1, 1, 3, 1, 3 }; ` ` ` `int` `n = ` `sizeof` `(x) / ` `sizeof` `(` `int` `); ` ` ` ` ` `Print(x, y, n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to prthe coordinates along with ` `# their frequency in ascending order ` `def` `Print` `(x, y, n): ` ` ` ` ` `# map to store the pairs ` ` ` `# and their frequencies ` ` ` `m ` `=` `dict` `() ` ` ` ` ` `# Store the coordinates along ` ` ` `# with their frequencies ` ` ` `for` `i ` `in` `range` `(n): ` ` ` `m[(x[i], y[i])] ` `=` `m.get((x[i], ` ` ` `y[i]), ` `0` `) ` `+` `1` ` ` ` ` `e ` `=` `sorted` `(m) ` ` ` ` ` `for` `i ` `in` `e: ` ` ` `print` `(i[` `0` `], i[` `1` `], m[i]) ` ` ` `# Driver code ` `x ` `=` `[` `1` `, ` `2` `, ` `1` `, ` `1` `, ` `1` `] ` `y ` `=` `[` `1` `, ` `1` `, ` `3` `, ` `1` `, ` `3` `] ` `n ` `=` `len` `(x) ` ` ` `Print` `(x, y, n) ` ` ` `# This code is contributed ` `# by mohit kumar ` |

*chevron_right*

*filter_none*

**Output:**

1 1 2 1 3 2 2 1 1

## Recommended Posts:

- Print number in ascending order which contains 1, 2 and 3 in their digits.
- Print characters having even frequencies in order of occurrence
- Print characters having odd frequencies in order of occurrence
- Print numbers in descending order along with their frequencies
- Print characters having prime frequencies in order of occurrence
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Sorting rows of matrix in descending order followed by columns in ascending order
- Sorting rows of matrix in ascending order followed by columns in descending order
- Sort first k values in ascending order and remaining n-k values in descending order
- Sorting of Vector of Tuple in C++ (Ascending Order)
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Check if it is possible to rearrange rectangles in a non-ascending order of breadths
- Python | Sort words of sentence in ascending order
- Sort an array of string of dates in ascending order
- Sort all even numbers in ascending order and then sort all odd numbers in descending order

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.