shushus

Спринт 2. Кортежи. Начало. Задание 2.

Dec 7th, 2022
152
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.07 KB | None | 0 0
  1. #include <algorithm>
  2. #include <iostream>
  3. #include <vector>
  4. #include <tuple>
  5.  
  6. using namespace std;
  7.  
  8. enum class Status { ACTUAL, EXPIRED, DELETED };
  9.  
  10. struct Document{
  11.     int id;
  12.     Status status;
  13.     double relevance;
  14.     int rating;
  15.    
  16.     auto MakeKey() const{
  17.     return tuple(status, rating*-1, relevance*-1);
  18. }
  19.    
  20. };
  21.  
  22.  
  23.  
  24. void SortDocuments(vector<Document>& matched_documents) {
  25.     sort(matched_documents.begin(), matched_documents.end(),
  26.          [](const Document& lhs, const Document& rhs) {
  27.              return lhs.MakeKey() < rhs.MakeKey();
  28.          });
  29. }
  30.  
  31. int main() {
  32.     vector<Document> documents = {
  33.         {100, Status::ACTUAL, 0.5, 4}, {101, Status::EXPIRED, 0.5, 4},
  34.         {102, Status::ACTUAL, 1.2, 4}, {103, Status::DELETED, 1.2, 4},
  35.         {104, Status::ACTUAL, 0.3, 5},
  36.     };
  37.     SortDocuments(documents);
  38.     for (const Document& document : documents) {
  39.         cout << document.id << ' ' << static_cast<int>(document.status) << ' ' << document.relevance
  40.              << ' ' << document.rating << endl;
  41.     }
  42.  
  43.     return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment