Given an integer K and an array arr each of whose element x represents a square with two of its vertices as (0, 0) and (x, x). The task is to find a point which lies in exactly K squares.
Examples:
Input: arr[] = {1, 2, 3, 4}, K = 2
Output: (3, 3)
The point (3, 3) lies inside 3rd and 4th square only.Input: arr[] = {8, 1, 55, 90}, K = 3
Output: (8, 8)
Approach: Since all squares have a common corner point (0, 0), any point which lies in any square would also lie in any larger square. Hence, we can simply print the other corner of the Kth largest square.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; int PointInKSquares(int n, int a[], int k) { sort(a, a + n); return a[n - k]; } // Driver Program to test above function int main() { int k = 2; int a[] = { 1, 2, 3, 4 }; int n = sizeof(a) / sizeof(a[0]); int x = PointInKSquares(n, a, k); cout << "(" << x << ", " << x << ")"; } |
Java
// Java implementation of the approach import java.io.*; import java.util.*; class GFG { static int PointInKSquares(int n, int a[], int k) { Arrays.sort(a); return a[n - k]; } // Driver Program to test above function public static void main (String[] args) { int k = 2; int []a = { 1, 2, 3, 4 }; int n = a.length; int x = PointInKSquares(n, a, k); System.out.println( "(" + x + ", " + x +")"); } } // This code is contributed by anuj_67.. |
Python3
# Python 3 implementation of the # above approach def PointInKSquares(n, a, k) : a.sort() return a[n - k] # Driver Code if __name__ == "__main__" : k = 2 a = [1, 2, 3, 4] n = len(a) x = PointInKSquares(n, a, k) print("(", x, ",", x, ")") # This code is contributed by Ryuga |
C#
// C# implementation of the approach using System; class GFG { static int PointInKSquares(int n, int []a, int k) { Array.Sort(a); return a[n - k]; } // Driver Code public static void Main (String[] args) { int k = 2; int []a = { 1, 2, 3, 4 }; int n = a.Length; int x = PointInKSquares(n, a, k); Console.WriteLine("(" + x + ", " + x +")"); } } // This code is contributed // by Arnab Kundu |
PHP
<?php // PHP implementation of the approach function PointInKSquares($n, $a, $k) { sort($a); return $a[$n - $k]; } // Driver Code $k = 2; $a = array(1, 2, 3, 4); $n = sizeof($a); $x = PointInKSquares($n, $a, $k); echo "(" . $x . ", " . $x . ")"; // This code is contributed // by Akanksha Rai ?> |
(3, 3)
Recommended Posts:
- Find if a point lies inside a Circle
- Check if a point lies on or inside a rectangle | Set-2
- Check whether a point lies inside a sphere or not
- Check whether a given point lies inside a rectangle or not
- Check whether a given point lies on or inside the rectangle | Set 3
- Check whether a given point lies inside a triangle or not
- How to check if a given point lies inside or outside a polygon?
- Find intersection point of lines inside a section
- Find minimum radius such that atleast k point lie inside the circle
- Check if a given circle lies completely inside the ring formed by two concentric circles
- Maximum number of 2x2 squares that can be fit inside a right isosceles triangle
- Triangle with no point inside
- Check if a point is inside, outside or on the ellipse
- Check if a point is inside, outside or on the parabola
- Find the GCD that lies in given range
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.