让我帮帮你改一下格式
```
include<iostream>
include<cstdio>
include<algorithm>
using namespace std; int f[900001]; struct node { int u1,v1,w1,cl1; } e1[1000001]; struct Node { int u,v,w,cl; } e[1000001]; bool cmp(Node a,Node b) { if(a.w==b.w) return a.cl<b.cl; return a.w<b.w; } int find(int x) { if(f[x]!=x) f[x]=find(f[x]); return f[x]; } int n,m,need,sum=0,l=-10000,r=10000,mid,countx,bian=0; bool zxscs(int pyl) { bian=0; sum=0; countx=0; for(int i=0; i<n; i++) { f[i]=i; } for(int i=1; i<=m; i++) { e[i].u=e1[i].u1; e[i].v=e1[i].v1; e[i].w=e1[i].w1; e[i].cl=e1[i].cl1; if(e1[i].cl1==0) { e[i].w+=mid; } } sort(e+1,e+m+1,cmp); for(int i=1; i<=m; i++) { int fi=find(e[i].u); int fj=find(e[i].v); if(fi!=fj) { f[fj]=fi; if(e[i].cl==0) countx++; sum+=e[i].w; bian++; } if(bian==n-1) break; } if(countx>=need) return true; else return false; } int main() { cin>>n>>m>>need; int a,b,c,d; for(int i=1; i<=m; i++) { cin>>a>>b>>c>>d; e1[i].u1=a; e1[i].v1=b; e1[i].w1=c; e1[i].cl1=d; } while(l<=r) { mid=(l+r)/2; if(zxscs(mid)==true) l=mid+1; else r=mid-1; } zxscs(mid); cout<<sum-need*mid; }
```
by 斯茂 @ 2018-09-13 21:08:48
额，话说你写代码都不换行？？？
by 斯茂 @ 2018-09-13 21:09:04
但据我所知，你的main貌似没有return 0
by 斯茂 @ 2018-09-13 21:09:27
@[韩沛煊](/space/show?uid=47140) 可以不加return 0吧qwq
by koosi @ 2018-09-25 16:34:38
希望更丰富的展现？[使用Markdown](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by BuXiangJuanLe @ 2018-10-07 08:34:02