HDOJ 继续通畅工程(pid=1879
------------------------------
个人题解
[analysis]
struct{
int C;
int S;
}V;
int N,sum;
cin>>N;
int A=new V[N];
for(int i=0;i<N(N-1)/2;i++){
cin>>A[i]->C;
cin>>A[i]->S;
}
sort(A[i],A[i]->C);//upper
for(int j=0;j<(N(N-1)/2);i++){
sum=A[j]->S==0?sum+A[i]->C:sum+0;
if(j==(N(N-1)/2)-1)&&A[j]==1]) sum-=A[j]-C;
}
cout>>sum>>endl;
[conclusion]
At first to a cycle then cut