A problem in which you must output the lowest integer to appear K times in a sequence of integers.
A problem in which you must output the lowest integer to appear K times in a sequence of integers.

I went with one method using pair objects first but it ended up taking too long to pass the test cases, so I went with a more streamlined solution, using an array sort to allow me to only have single loops.
jamtot/Java