Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
NBiggestNum
//Title of this code #include <iostream> #include <vector> #include <algorithm> #include <list> using namespace std; void insert(list<int>& l) { } list<int> findNBiggest(vector<int>& t, int n) { int i; list<int> nBiggest; for (i = 0; i < n; ++i) nBiggest.push_back(t[i]); nBiggest.sort(); auto it = nBiggest.begin(); for (i = n; i < t.size(); ++i) if (t[i] > *nBiggest.begin()) { nBiggest.erase(nBiggest.begin()); // sorted insert ;) nBiggest.push_back(t[i]); nBiggest.sort(); } return nBiggest; } void print(list<int>& l) { for (auto it = l.begin(); it != l.end(); ++it) cout << *it << " "; } int main() { vector<int> t; t.push_back(7); t.push_back(8); t.push_back(3); t.push_back(4); t.push_back(5); t.push_back(6); list<int> l = findNBiggest(t, 3); print(l); }
run
|
edit
|
history
|
help
0
Dar
Bit count in number
FloydTriangle
Random Vector Generator
32bit
Conjuntos - analizar la lógica
typecasting
ncr
345325
Nadpisanie metod