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

using namespace std;

struct Document {
    int id;
    int rating;
};
bool HasDocumentGreaterRate(const Document& left, const Document& right) {
    return left.rating > right.rating;
}

void PrintDocuments(vector<Document> documents, size_t skip_start, size_t skip_finish) {

    if ((skip_start + skip_finish) >= documents.size() or documents.empty()) {
        cout << endl;
    }
    else {
        sort(documents.begin(), documents.end(), HasDocumentGreaterRate);

        for (size_t k = skip_start; k < documents.size() - skip_finish; ++k) {
            cout << "{ id = "s << documents[k].id << ", rating = "s << documents[k].rating << " }"s << endl;
        }
    }
    //cout << skip_start << " " << skip_finish;
}

int main() {
    //PrintDocuments({ {100, 5}, {101, 7}, {102, -4}, {103, 9}, {104, 1} }, 5, 0);
    PrintDocuments({ {100, 5} }, 0, 0);
}