Структуры в динамической памяти. - Visual C++ - Ответ 163065

#include <string>
#include <algorithm>
#include <functional>
#include <iostream>
 
struct Marsh
{
    std::string source_;
    std::string destination_;
    size_t number_;
 
    friend bool operator < (const Marsh& m1, const Marsh& m2)
    { return m1.number_ < m2.number_; }
};
 
template <typename OS>
OS& operator >> (OS& os, Marsh& m)
{ return os >> m.source_ >> m.destination_ >> m.number_; }
 
template <typename OS>
OS& operator << (OS& os, const Marsh& m)
{ return os << m.source_ << " " << m.destination_ << " " << m.number_; }
 
template <typename T>
struct equal : public std::unary_function<T, bool>
{
    equal(const std::string point) : point_(point) {}
    bool operator()(const T& v) const
    { return v.source_ == point_ || v.destination_ == point_; }
    const std::string point_;
};
 
int main()
{
    const size_t N = 8;
    Marsh m[N];
    for (size_t i=0; i<N; i++)
        std::cin >> m[i];
 
    std::sort(m, m+N);
 
    std::string point;
    std::cin >> point;
 
    const Marsh* found = std::find_if(m, m+N, equal<Marsh>(point));
    if (found == m+N)
        std::cerr << "Маршрутов нет, насяльника!" << std::endl;
    else
        std::cout << *found;
 
    return 0;
}