title: Greedy Algorithm Number List
body: <p>I am working at c++ and I need to find a greedy algorithm that given an array of positive integers, determines which pairs of summed even equal numbers have to the right of the array some odd number greater than that sum. Returning all possibilities. I have thought about creating a list of pair numbers and its position, so I could go from this position to the end. But these substructure gives me the answer, so it's not a greedy algorithm, adding that it's criteria is not correct. Can someone help me?</p>
  <pre><code>Example:
  [4,5,9,4,0,11,6,6,8,8,91,73,7,69]
  
  Output:
  [4,4,11,91,73,69]
  [6,6,91,73,69]
  [8,8,11,91,73,69]
  </code></pre>
  <p>Thanks :)</p>