# 查找數組中至少有兩個大元素的所有元素 > 原文： [https://www.geeksforgeeks.org/find-elements-array-least-two-greater-elements/](https://www.geeksforgeeks.org/find-elements-array-least-two-greater-elements/) 給定`n`個不同元素的數組，任務是查找數組中所有元素至少比其大兩個元素。 **示例**： ``` Input : arr[] = {2, 8, 7, 1, 5}; Output : 2 1 5 The output three elements have two or more greater elements Input : arr[] = {7, -2, 3, 4, 9, -1}; Output : -2 3 4 -1 ``` **方法 1（簡單）** 樸素的方法是運行兩個循環并逐個檢查數組元素，以檢查數組元素至少有兩個大于其自身的元素。 如果為`true`，則打印數組元素。 ## C++ ```cpp // Simple C++ program to find // all elements in array which? // have at-least two greater? // elements itself. #include<bits/stdc++.h> using namespace std; void findElements(int arr[], int n) { ????// Pick elements one by one and? ????// count greater elements. If? ????// count is more than 2, print? ????// that element. ????for (int i = 0; i < n; i++) ????{ ????????int count = 0; ????????for (int j = 0; j < n; j++) ????????????if (arr[j] > arr[i]) ????????????????count++; ????????if (count >= 2) ????????????cout << arr[i] << " "; ????} } // Driver code int main() { ????int arr[] = { 2, -6 ,3 , 5, 1}; ????int n = sizeof(arr) / sizeof(arr[0]); ????findElements(arr, n); ????return 0; } ```