poj1062-昂贵的聘礼

#include<iostream>
#include<cstdlib>
#include<string.h>
using namespace std;
const int MAX_SIZE = 110;
struct node {
  int value;  //直接交易的价格
  int order;  //地位
}v[MAX_SIZE]; //顶点集合
bool vis[MAX_SIZE];
int edge[MAX_SIZE][MAX_SIZE];  //边集
int q[MAX_SIZE];  //距离
int m, n;
void read()
{
  int k;
  for(int i=1; i<=n; i++) {
    cin >> v[i].value >> v[i].order >> k;
    for(int j=0; j<k; j++) {
      int u;
      cin >> u; cin >> edge[u][i];
    }
    edge[0][i] = v[i].value;
  }
}
int dist(int k)
{
  for(int i=1; i<=n; i++)
    q[i] = v[i].value;
  for(int i=1; i<=n; i++) {
    int minNum = 1e9;
    int x = k;
    for(int j=1; j<=n; j++) {
      if(vis[j]) continue;
      if(q[j] < minNum) { minNum = q[j]; x = j; }
    }
    vis[x] = true;
    for(int j=1; j<=n; j++) {
      if(vis[j]) continue;
      q[j] = min(q[j], q[x] + edge[x][j]);
    }
  }
  return q[1];
}
int main()
{
  int mins = 1e9;
  cin >> m >> n;
  for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) edge[i][j] = 1e9;
  read();  //读取
  for(int i=1; i<=n; i++) {
    int sum;
    memset(vis, 0, sizeof(vis));
    for(int j=1; j<=n; j++)
      if(v[j].order > v[i].order || (v[i].order - v[j].order > m)) {
            vis[j] = true;
      }
    sum = dist(i);
    if(sum < mins) mins = sum;
  }
  cout << mins << endl;
  return 0;
}