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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
| #include <iostream>
#include <string>
#include <algorithm>
#include <boost/date_time/posix_time/posix_time.hpp>
namespace pt = boost::posix_time;
struct train
{
std::string name_of_route;
pt::ptime time_of_sending;
pt::ptime time_of_arrival;
int length_of_route;
};
std::ostream & operator<< (std::ostream &, const train &);
int main()
{
pt::ptime current_date (pt::second_clock::local_time());
int const N = 5;
train trains[N] =
{
{"Qwerty", current_date, current_date + pt::hours (5) + pt::minutes(30), 155},
{"Abc", current_date, current_date + pt::hours (30), 800},
{"C++", current_date, current_date + pt::hours (100) + pt::minutes(5), 5000},
{"Cyber", current_date, current_date + pt::minutes (55) + pt::seconds(30), 40},
{"WWW", current_date, current_date + pt::minutes (60), 200}
};
// средняя скорость каждого поезда
double middle_speed[N];
// время в пути каждого поезда
pt::time_duration time_in_way[N];
for (int i = 0; i < N; i++)
{
pt::time_period t_period (trains[i].time_of_sending, trains[i].time_of_arrival);
time_in_way[i] = t_period.length();
middle_speed[i] = trains[i].length_of_route / (time_in_way[i].hours() +
time_in_way[i].minutes() / 60.0 +
time_in_way[i].seconds() / 3600.0);
}
// сортировка по времени в пути
for (int i = 0; i < N - 1; i++)
{
for (int j = i + 1; j < N; j++)
{
if (time_in_way[j] < time_in_way[i])
{
std::swap (trains[i], trains[j]);
std::swap (time_in_way[j], time_in_way[i]);
}
}
}
for (int i = 0; i < N; i++)
std::cout <<trains[i];
std::cout <<"---------------------------------------------\n";
// время в пути - меньше 4 часов
int time_hours = 4;
for (int i = 0; i < N && time_in_way[i].hours() +
time_in_way[i].minutes() / 60.0 +
time_in_way[i].seconds() / 3600.0 < time_hours; i++)
{
std::cout << trains[i].name_of_route << std::endl;
}
std::cout <<"---------------------------------------------\n";
// сортировка по средней скорости движения
for (int i = 0; i < N - 1; i++)
{
for (int j = i + 1; j < N; j++)
{
if (middle_speed[j] < middle_speed[i])
{
std::swap (trains[i], trains[j]);
std::swap (middle_speed[j], middle_speed[i]);
}
}
}
for (int i = 0; i < N; i++)
std::cout <<trains[i];
std::cout <<"---------------------------------------------\n";
}
std::ostream & operator<< (std::ostream & stream, const train & object)
{
stream << object.name_of_route << std::endl
<< object.time_of_sending << std::endl
<< object.time_of_arrival << std::endl
<< object.length_of_route << "\n\n";
return stream;
} |
(
Сообщение было отмечено Daria H как решение
