peti

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int N = 0;
    do {
        cout << "Upisite N: ";
        cin >> N;
    }while(N <= 0 || N > 1000);

    int numElem[4];
    numElem[0] = numElem[1] = numElem[2] = numElem[3] = 0;
    int polje1[N];
    int polje2[N];
    int polje3[N];
    int polje4[N];

    int num = 0;
    for(int i = 0; i < N; ++i) {
        cout << "Upisite " << i+1 << ". broj: ";
        cin >> num;
        if(num % 4 == 0) {
            polje1[numElem[0]] = num;
            ++numElem[0];
        } else if(num % 4 == 1) {
            polje2[numElem[1]] = num;
            ++numElem[1];
        } else if(num % 4 == 2) {
            polje3[numElem[2]] = num;
            ++numElem[2];
        } else {
            polje4[numElem[3]] = num;
            ++numElem[3];
        }
    }

    sort(polje1, polje1 + numElem[0]);
    sort(polje2, polje2 + numElem[1]);
    sort(polje3, polje3 + numElem[2]);
    sort(polje4, polje4 + numElem[3]);

    for(int i = 0; i < numElem[0]; ++i)
        cout << polje1[i] << " ";
    cout << endl;

    for(int i = 0; i < numElem[1]; ++i)
        cout << polje2[i] << " ";
    cout << endl;

    for(int i = 0; i < numElem[2]; ++i)
        cout << polje3[i] << " ";
    cout << endl;

    for(int i = 0; i < numElem[3]; ++i)
        cout << polje4[i] << " ";
    cout << endl;

}