是因为用了STL才会T吗？？？？？

#include<bits/stdc++.h>
using namespace std;

int n,m,s,u,v,w;
int dis[100100];
bool blue[100100];
vector<int> to[100100], val[100100];
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > >q;

inline void read(int &a){
	int x = 0, f = 1;
	char c = getchar();
	while(c<'0' || c>'9'){
		if(c == '-') f = -f;
		c = getchar();
	}
	while(c>='0' && c<='9'){
		x = (x<<3) + (x<<1) + (c-'0');
		c = getchar();
	}
	a = x*f;
}

inline void write(int x){
	if(x >= 10) write(x/10);
	putchar(x%10 + '0');
}

int main(){
	read(n), read(m), read(s);
	for(int i = 1; i <= m; i++){
		read(u), read(v), read(w);
		to[u].push_back(v);
		val[u].push_back(w);
	}
	memset(dis, 127/3, sizeof(dis));
	for(int i = 1; i <= n; i++) blue[i] = true;
	dis[s] = 0;
	q.push(make_pair(0,s));
	for(int i = 1; i <= n; i++){
		int now = q.top().second;
		q.pop();
		while(blue[now] == false && !q.empty()){
			now = q.top().second;
			q.pop();
		}
		blue[now] = false;
		for(int j = 0; j < to[now].size(); j++){
			int end = to[now][j];
			int len = val[now][j];
			if(dis[now] + len < dis[end]){
				dis[end] = dis[now] + len;
				q.push(make_pair(dis[end], end));
			}
		}
	}
	
	for(int i = 1; i <= n; i++){
		write(dis[i]);
		putchar(' ');
	}
	
	
	
	return 0;
}