[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["The `TopN` class is designed to manage and track the top N elements based on their scores."],["It provides methods to add elements with scores, clear the current set, and access the unordered elements."],["Initialization requires specifying the desired number of top elements (N)."],["The `Add` method incorporates new elements and their scores, updating the top N accordingly."],["The `UnorderedElements` method retrieves all the currently stored elements without any specific ordering."]]],["The `TopN` class in C++ provides methods for managing a collection of elements. `Add` adds an element with an associated score. `Clear` removes all elements. `TopN` is the constructor, initializing the capacity to hold *n* elements. `UnorderedElements` returns a vector containing the current elements, which may be in any order. The class is part of the OR-Tools library and can be found in the `linear_constraint_manager.h` header file.\n"]]
