treci

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

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

    double poljeX[N];
    double poljeY[N];
    double poljeZ[N];
    double poljeW[N];

    for(int i = 0; i < N; ++i) {
        cout << "Upisite " << i+1 << ". element: X:";
        cin >> poljeX[i];

        cout << "Upisite " << i+1 << ". element: Y:";
        cin >> poljeY[i];

        cout << "Upisite " << i+1 << ". element: Z:";
        cin >> poljeZ[i];

        cout << "Upisite " << i+1 << ". element: W:";
        cin >> poljeW[i];
    }
    std::sort(poljeX, poljeX + N);
    std::sort(poljeY, poljeY + N, std::greater<double>());
    std::sort(poljeZ, poljeZ + N);
    std::sort(poljeW, poljeW + N, std::greater<double>());

    for(int i = 0; i < N; ++i) {
        cout <<  poljeX[i] << " " << poljeY[i] << " " << poljeZ[i] << " " << poljeW[i] << endl;
    }

    return 0;
}