(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:
|
#include
#include
#include
#include
#include
#include
using namespace std;
struct StudentAttempt
{
int odległość;
smyczkowy studentName;
};
bool cmpAttempts (StudentAttempt opuszczać, StudentAttempt dobro) {
jeżeli (left.distance < right.distance) {
powrót prawdziwy;
}
inny jeżeli (left.distance == right.distance) {
jeżeli (left.studentName < right.studentName) {
powrót prawdziwy;
}
inny
powrotny fałszywy;
}
inny
powrotny fałszywy;
}
bool isDistEqual (StudentAttempt opuszczać, StudentAttempt dobro) {
powrót (left.distance == right.distance
&& left.studentName! = right.studentName);
}
size_t printAllEqual (const vector& v, const StudentAttempt& suma, string& str) {
vector:: const_iterator i = v.begin ();
size_t sz = (0);
podczas gdy (i! = v.end ()) {
jeżeli (isDistEqual (*i, suma)) {
str += i->studentName;
++sz;
}
++i;
}
powrotny sz;
}
int magistrala () {
StudentAttempt throwDist [] = {
{50, "A"}, {22, "A"}, {16, "B"}, {44, "C"},
{33, "D"}, {34, "E"}, {22, "F"}, {21, "G"},
{49, "A"}, {5, "B"}, {2, "C"}, {22, "A"},
{33, "B"}, {22, "C"}, {22, "D"}, {44, "E"},
};
set obchodzić się;
int len = sizeof (throwDist)/sizeof (throwDist [(0)]);
vector dist (throwDist, throwDist + len);
vector:: iterator ono = dist.begin ();
rodzaj (dist.begin (), dist.end (), cmpAttempts);
dla (; ono! = dist.end (); it++) {
smyczkowy str;
pair:: iterator, bool> p = handled.insert (it->distance);
jeżeli (! p.second) kontynuować; // już obchodzić się
jeżeli ((0) < printAllEqual (dist, *it, str)) {
cout << setw (2) << (*it) .distance << "cieki: " << (*it) .studentName << str << endl;
}
}
}
|
