C++ 벡터 top3

1 개요[ | ]

C++ 벡터 top 3

2 오름차순[ | ]

unordered
#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

int main() {
    vector<int> v {7, 2, 5, 4};
    nth_element(v.begin(), v.begin()+2, v.end());
    vector<int> top3 = {v.begin(), v.begin()+3};
    for(int el: top3) cout << el << ' '; // 4 2 5
}
ordered
#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

int main() {
    vector<int> v {7, 2, 5, 4};
    nth_element(v.begin(), v.begin()+2, v.end());
    vector<int> top3 = {v.begin(), v.begin()+3};
    sort(top3.begin(), top3.end());
    for(int el: top3) cout << el << ' '; // 2 4 5
}

3 내림차순[ | ]

unordered
#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

int main() {
    vector<int> v {4, 5, 7, 2};
    nth_element(v.begin(), v.begin()+2, v.end(), greater{});
    vector<int> top3 = {v.begin(), v.begin()+3};
    for(int el: top3) cout << el << ' '; // 5 7 4
}
ordered
#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

int main() {
    vector<int> v {4, 5, 7, 2};
    nth_element(v.begin(), v.begin()+2, v.end(), greater{});
    vector<int> top3 = {v.begin(), v.begin()+3};
    sort(top3.begin(), top3.end(), greater{});
    for(int el: top3) cout << el << ' '; // 7 5 4
}

4 같이 보기[ | ]

문서 댓글 ({{ doc_comments.length }})
{{ comment.name }} {{ comment.created | snstime }}