Zadanie spoj - statystyka pozycyjna

#include <iostream>
#include <set>

using namespace std;

int main()
{
    int n;
    while (cin >> n) {
        cin.get();
        set<int> input_list;
        int k;
        while (cin >> k) {
            input_list.insert(k);
            if (cin.get() != ' ') break;
        }
        if ((int) input_list.size() < n) {
            cout << "-" << endl;
        } else {
            int i = 1;
            for (set<int>::reverse_iterator it = input_list.rbegin(); it != input_list.rend(); ++it) {
                if (i == n) {
                    cout << *it << endl;
                    break;
                }
                ++i;
            }
        }
    }
    return 0;
}

#include <iostream>
#include <set>
#include <string>
#include <sstream>

using namespace std;

int main()
{
    int n;
    string line;
    while (getline(cin, line)) {
    	stringstream in(line);
    	if (!(in >> n))
    		break;
        set<int> input_list;
        int k;
        while (in >> k) {
            input_list.insert(k);
        }
        if ((int) input_list.size() < n) {
            cout << "-" << endl;
        } else {
            int i = 1;
            for (set<int>::reverse_iterator it = input_list.rbegin(); it != input_list.rend(); ++it) {
                if (i == n) {
                    cout << *it << endl;
                    break;
                }
                ++i;
            }
        }
    }
    return 0;
}