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;
- double relevance;
- int rating;
- };
- void SortDocuments(vector<Document>& matched_documents) {
- sort(matched_documents.begin(), matched_documents.end(),
- [](const Document& lhs, const Document& rhs) {
- return pair(lhs.rating, lhs.relevance) > pair(rhs.rating, rhs.relevance);
- });
- }
- int main() {
- vector<Document> documents = {{100, 0.5, 4}, {101, 1.2, 4}, {102, 0.3, 5}};
- SortDocuments(documents);
- for (const Document& document : documents) {
- cout << document.id << ' ' << document.relevance << ' ' << document.rating << endl;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment