Задача на c++ на обратную перестановку

 #include <algorithm> 
#include <iostream> 
#include <vector>

using namespace std;

class Guest { 
public: 
    Guest() : number(0), place(0) {} 
    static void reset() { 
        next = 0; 
    } 
private: 
    inline static unsigned next = 0; 
    unsigned number; 
    unsigned place; 
    friend istream& operator>>(istream& inp, Guest& guest) { 
        inp >> guest.number; 
        guest.place = ++guest.next; 
        return inp; 
    } 
    friend ostream& operator<<(ostream& out, const Guest& guest) { 
        return out << guest.place; 
    } 
    friend bool operator<(const Guest& left, const Guest& right) { 
        return left.number < right.number; 
    } 
};

class Guests { 
public: 
    Guests(const size_t count) { 
        guests.resize(count); 
        Guest::reset(); 
    } 
    void order_by_place() { 
        sort(begin(guests), end(guests)); 
    } 
private: 
    vector<Guest> guests; 
    friend istream& operator>>(istream& inp, Guests& came) { 
        for (auto& guest : came.guests) inp >> guest; 
        return inp; 
    } 
    friend ostream& operator<<(ostream& out, const Guests& came) { 
        for (const auto& guest : came.guests) out << guest << ' '; 
        return out.put('\n'); 
    } 
};

int main() { 
    size_t n; 
    cin >> n; 
    Guests guests(n); 
    cin >> guests; 
    guests.order_by_place(); 
    cout << guests; 
}