5.

#include <iostream>
using namespace std;

void SelSort(int polje[], int num) {
    for(int i = num - 1; i > 0; i-- )
        for(int j = 0; j < i; j++)
            if(polje[j] > polje[j+1])
                swap(polje[j], polje[j+1]);
}
void NajBroj(int polje[], int num) {
    int i;
    cout << "i: ";
    cin >> i;
    if(i >= num)
        return;
    cout << polje[num - i] << endl;
}

int main() {
    int N;
    do{
        cout << "Upisite N: ";
        cin >> N;
    }while( N < 0);
    int polje[N];
    for(int i = 0; i < N; i++) {
        cout << i+1 << ": ";
        cin >> polje[i];
    }
    SelSort(polje, N);
    for(int i = 0; i < N; i++) {
        cout << polje[i] << " ";
    }
    cout << endl;
    NajBroj(polje, N);
    return 0;
}