|
DiffEreD
1436 / 773 / 95
Регистрация: 21.06.2011
Сообщений: 1,740
|
|
18.01.2013, 12:41
|
|
С STL дружите? | C++ | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
| #include <iostream>
#include <array>
#include <vector>
#include <algorithm>
#include <functional>
int main()
{
std::array<int, 10> some_array = {6,7,3,0,9,5,2,4,3,9};
std::vector<int> v(some_array.rbegin(), some_array.rend());
std::cout<<"array 1: "; for (int val : some_array) std::cout<<val<<" "; std::cout<<"\n";
std::cout<<"array 2: "; for (int val : v) std::cout<<val<<" "; std::cout<<"\n";
std::partial_sort(some_array.begin(), some_array.begin()+5, some_array.end(), std::greater<int>());
std::cout<<"array 1(sorted first 5): "; for (int val : some_array) std::cout<<val<<" "; std::cout<<"\n";
v.insert(std::min_element(v.begin(), v.end()), some_array.begin(), some_array.begin()+5);
std::cout<<"array 2(after inserted): "; for (int val : v) std::cout<<val<<" "; std::cout<<"\n";
std::cout<<"\n";
system("pause");
return 0;
} |
|
0
|
