How to solve the NP-complete problem of sorting items by votes?

Question

C++ / C#

Help solve the problem using an approximate algorithm.
Task: there is a set of n items, and there are m votes, for example 1 3 1, which means that item 1 is better than item 3, you need to find such an order of items that would take into account at most half the votes from the maximum possible.