/
t.cpp
56 lines (52 loc) · 1.12 KB
/
t.cpp
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
#include <string>
#include <vector>
#include <thread>
#include <functional>
#include <algorithm>
using namespace std;
class WaterSystem {
public:
virtual ~WaterSystem(){cleanup();}
virtual void cleanup(){
cout<<"ws clean"<<endl;
}
};
class Pump: public WaterSystem{
public:
virtual void cleanup(){
cout<<"pump clean"<<endl;
WaterSystem::cleanup();
}
};
class v{
public:
~v(){cout<<"v"<<endl;}
};
class e{
public:
~e(){cout<<"e"<<endl;}
};
class t : public v{
public:
~t(){cout<<"t"<<endl;}
private:
e thee;
};
int acc(const vector<int> &v, const unsigned int index){
if(index>=v.size()){throw std::out_of_range("i too");}
return v[index];
}
template<typename T, typename U>
bool cam(const T& lhs, const U& rhs){
return lhs>rhs;
}
int main(){
vector<int> my = {1,2,3};
cam(true,false);
vector<pair<int,int>> pairs{{1,9},{3,4},{1,2},{2,4}};
vector<int> v{1,2,3,5,2,2,6,2,3};
sort(pairs.begin(),pairs.end(),[]( auto & a, auto & b)->bool{return a.first<b.first;});
cout<<"ascending";
return 0;
}