небоскреб

#include<iostream>
#include <cmath>
using namespace std;

const int inf = 10000000;
struct travel
{
 int begin, end, cost;
 void new_travel(int begin, int end, int cost)
 {
   this->begin = begin;
   this->end = end;
   this->cost = cost;
 }
};

class Graph
{
  private:
  int n, **arr, shet_lift_travel, const_koef, *d;
  travel *vse_rebra;

  public:
  Graph (travel *matrix, int x, int m, int c)
  {
    n = x;
    shet_lift_travel = m;
    const_koef = c;
    vse_rebra = matrix;
    d = new int[n];

    arr = new int*[n];

    for (int i = 0; i < n; i++)
     arr[i] = new int[n];

    for (int i = 0; i < n; i++)
     for (int j = 0; j < n; j++)
        {
          arr[i][j] = inf;
          if (i == j)
          arr[i][j] = -1;
        }

    for (int i = 0; i < shet_lift_travel; i++)
      {
        arr[vse_rebra[i].begin][vse_rebra[i].end] = vse_rebra[i].cost;
        arr[vse_rebra[i].end][vse_rebra[i].begin] = vse_rebra[i].cost;
      }

    for (int i = 0; i < n; i++)
     for (int j = 0; j < n; j++)
        arr[i][j] = min (abs(j-i)*const_koef, arr[i][j]);
  }
  void get_array();
  void minpath(int x);
  int get_length_path(int x, int y);
};

void Graph::minpath(int x)
{
  int w, min, j;
  bool *old = new bool[n];
  int *path = new int[n];

  for ( int i = 0; i < n; i++)
  {
    d[i] = arr[x][i];
    old[i] = false;
    path[i] = x;
  }

  old[x] = true;

 for (int i = 1; i < n; i++)
   {
     for ( w = -1, min = inf, j = 0; j < n; j++)
      if (!old[j] && d[j] < min)
      {
        w = j;
        min = d[j];
      }
     if (w < 0)
        break;

     for (old[w] = true, j = 0; j < n; j++)
      if (!old[j] && d[j] > d[w] + arr[w][j])
      {
        d[j] = d[w] + arr[w][j];
        path[j] = w;
      }
  }

delete [] old;
}

int Graph::get_length_path(int x, int y)
{
 int dlina = 0;
  minpath(x);

 dlina = d[y];
 return dlina;
}

void Graph::get_array()
{
  for (int i = 0; i < n; i++)
   {
     for(int j = 0; j < n; j++)
      {
        cout.width(3);
        cout << arr[i][j] << " ";
      }
      cout << endl;
   }
}

int main()
{
 int n, m, koef_slov, floor_begin = 0, floor_end = 0, a = 0, b = 0, slova = 0;

 cin >> n >> m >> koef_slov;
 cin >> floor_begin >> floor_end;

travel *arr = new travel[m];

for (int i = 0; i < m; i++)
  {
    cin >> a >> b >> slova;
    a--;
    b--;
    arr[i].new_travel(a, b, slova);
  }

 Graph object(arr, n, m, koef_slov);
 cout << object.get_length_path(floor_begin-1, floor_end-1);
}