Read a count n, a threshold, and then n integers into a heap-allocated array (all done for you). Print only
the elements strictly greater than threshold, space-separated, in their original order – an empty line if none
qualify.
The one wrinkle beyond straightforward filtering: since you don’t know in advance how many elements will qualify,
“print a space between elements” can’t be based on the loop index the way earlier exercises’ “print the whole
array” code could (if (i < n - 1)). Track whether you’ve already printed something instead, and use that to
decide whether to print a leading space before the next qualifying value.