NGE

#include <iostream>#include <stack>#include <vector>using namespace std;int findNGE(vector<int> &arr, int length){ stack<int> s; s.push(arr[0]);  for (int i = 1; i < length; ++i) { int next = arr[i]; int top = s.top(); while (s.size() > 0 && top < next) { cout << top << "->" << next << endl; s.pop(); if (s.size() > 0) { top = s.top(); } } s.push(next); } while (s.size() > 0) { int top = s.top(); cout << top << "->" << -1 << endl; s.pop(); }return 0;}int main(){vector<int> arr = { 11, 13, 10, 5, 12, 21, 3 };findNGE(arr, arr.size());return 0;}