zhangyongzhe00的博客

1319：【例6.1】排队接水 #include<bits/stdc++.h> using namespace std; struct node{ int num; int time; }arr[5000]; bool cmp(node a,node b){ return a.time<b.time; } int main(){ int n; double time_sum=0,time_average; cin>>n; for(int i=1;i<=n;