求助!40分,从第九个点开始TLE,采用的冒泡排序
查看原帖
求助!40分,从第九个点开始TLE,采用的冒泡排序
104113
920106970115dzk楼主2020/8/28 09:12

源码如下

#include<bits/stdc++.h>
using namespace std;
int x[200001];
int main()
{
    int sf,z;
    int n,i,sw,tol,ans;
    cin>>n>>sf;
    for (i = 1; i <= n;i++)
    {cin>>x[i];}
for (z = 1;z<=n;z++)
    {for ( i = 1;i < n;i++)
        { if (x[i] < x[i+1])
            { sw = x[i+1];
              x[i+1] = x[i];
              x[i] = sw ;}
}}
n = 1;
ans = 0;
tol = 0;
    while ( tol < sf)
    { tol = tol + x[n];
        n = n+1;
ans++;}
cout<<ans<<endl;
return 0;
}
2020/8/28 09:12
加载中...