codeforces 707B B. Bakery(水题)

题目链接：

B. Bakery

题意：

是否存在一条连接特殊和不特殊的边,存在最小值是多少;

思路：

扫一遍所有边；

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>
#include <map>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));

typedef  long long LL;

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + '0');
    putchar('\n');
}

const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9+10;
const int N=1e5+10;
const int maxn=1e3+20;
const double eps=1e-12;

int n,m,k,x;
int vis[N],u[N],v[N],w[N];
int main()
{
    read(n);read(m);read(k);
    For(i,1,m)
    {
        read(u[i]);read(v[i]);read(w[i]);
    }
    For(i,1,k)
    {
        read(x);
        vis[x]=1;
    }
    int ans=inf;
    For(i,1,m)
    {
        if(!vis[u[i]]&&vis[v[i]])ans=min(ans,w[i]);
        if(!vis[v[i]]&&vis[u[i]])ans=min(ans,w[i]);
    }
    if(ans==inf)cout<<"-1"<<endl;
    else cout<<ans<<endl;
    return 0;
}