{"post":"

C++ program to find all elements in an array of integers that have at-least two greater elements.

Given: An array of n elements, we have to find all elements in the array which have at-least two greater elements than themselves.

Example:

Input: arr[] = { 15, 2, 20, 12, 40}

Output: 15, 2, 12

Input: arr[] = { -2, 9, 12, -7, 2, 10}
\nOutput: -2, 9, -7, 2

# Brute Force (using loops)

Input an array from the user having n elements.
Pick up elements one by one and count the number of greater elements.
If the count is greater than 2, then print that element.

Code:

#include<bits/stdc++.h>\nusing namespace std;\n\n// finds elements having at least two greater elements\nvoid greater_elements(int arr[], int n) {\n  cout << \"\\nElements which have at least two greater elements are: \";\n  for (int i = 0; i < n; i++) {\n    int var = 0;\n    for (int j = 0; j < n; j++) {\n      if (arr[j] > arr[i]) {\n        var++;\n      }\n    }\n    if (var >= 2) {\n      cout << arr[i] << \" \";\n    }\n  }\n}\n\nint main() {\n  int arr[100], n, i;\n  cout << \"Enter number of elements: \";\n  cin >> n;\n  cout << \"\\nEnter elements: \";\n  for (i = 0; i < n; i++) {\n    cin >> arr[i];\n  }\n  cout << \"Elements are: \";\n  for (i = 0; i < n; i++) {\n    cout << arr[i] << \" \";\n  }\n  greater_elements(arr, n);\n  return 0;\n}\n\n

Output

Enter number of elements: 5\n\nEnter elements: 1 4 3 2 5\nElements are: 1 4 3 2 5\n\nElements which have at least two greater elements are: 1 3 2 \n\n

Time Complexity : O(n2)

# Optimized Approach(using sorting)

Input array from user having n elements.
Sort the array in increasing order.
Print first n-2 elements.

Code:

#include<bits/stdc++.h>\nusing namespace std;\n\nvoid greater_elements(int arr[], int n) {\n  sort(arr, arr + n);\n  for (int i = 0; i < n - 2; i++) {\n    cout << \"\\n\" << arr[i] << \" \";\n  }\n}\n\n// Driver Code\nint main() {\n  int arr[100], n, i;\n  cout << \"Enter number of elements: \";\n  cin >> n;\n  cout << \"\\nEnter elements: \";\n  for (i = 0; i < n; i++) {\n    cin >> arr[i];\n  }\n  cout << \"\\nElements are: \";\n  for (i = 0; i < n; i++) {\n    cout << arr[i] << \", \";\n  }\n  cout << endl;\n  greater_elements(arr, n);\n  return 0;\n}\n\n

Output

Enter number of elements: 2\nEnter elements: 1 2\nElements are: 1, 2, \n

Time Complexity : O(n Log n)

\n","title":"Program to find all elements in array of integers which have at-least two greater elements in C++","authorDetails":{"name":"Prabhnoor Maingi","slug":"prabhnoor-maingi"},"description":"Learn how to find all elements in an array of integers that have at least two greater elements using C++. This program uses a simple iteration through the array to compare each element with the other elements and determine which elements have at least two greater elements.","slug":"cpp/examples/program-to-find-all-elements-in-array-having-at-least-two-greater-elements-cpp/","articleId":"636a83417bb1ce5072622b40","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}