Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <algorithm>
- #include <iostream>
- #include <vector>
- using namespace std;
- struct Document {
- int id;
- int rating;
- };
- void PrintDocuments(vector<Document> documents, size_t skip_start, size_t skip_finish) {
- // отсортировать документы и вывести не все
- if(!(documents.empty() || skip_finish>documents.size())){
- sort(begin(documents), end(documents), [](const Document& a, const Document& b){return a.rating>b.rating;});
- /*for (const auto [id, rating]: documents){
- cout<<id<<" "<<rating<<endl;
- }*/
- for(size_t k = skip_start; k < documents.size() - skip_finish; ++k){
- //int i = documents.size()-skip_finish;
- //size_t i = documents.size()-1;
- /*if (k<skip_start){
- documents.erase(documents.begin()+k);
- }
- if (k<skip_finish){
- documents.erase(documents.end()-1);
- }*/
- cout<<"{ id = "s<<documents[k].id<<", rating = "<<documents[k].rating<<" }"s<<endl;
- }
- }
- }
- int main() {
- PrintDocuments(
- {
- {100, 5},
- {101, 7},
- {102, -4},
- {103, 9},
- {104, 1}
- },
- 1,
- 2
- );
- }
Advertisement
Add Comment
Please, Sign In to add comment