2.

#include <iostream>
using namespace std;

void BubbleSort(int polje[], int N) {
    bool found = true;
    while(found) {
        found = false;
        for(int i = 0; i < N - 1; i++)
            if(polje[i] > polje[i+1]) {
                swap(polje[i], polje[i+1]);
                found = true;
            }
    }
}

void najmanj(int polje[], int N) {
    int i = 0;
    cout << "i: ";
    cin >> i;
    if(i > N)
        return;
    cout << polje[i - 1] << endl;
}

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