为什么在Front互加的情况下报了TLE?
| #1 | #2 | #3 | #4 | #5 | #6 | #7 | #8 | #9 | #10 |
|---|
| AC | TLE | AC | AC | AC | AC | TLE | TLE | TLE | TLE |
50pts:
#include<bits/stdc++.h>
using namespace std;
int n,sum=0;
int arr[10005],Front,Rear;
int main(){
cin>>n;
Front=1;
for(int i=1;i<=n;i++) cin>>arr[i];
sort(arr+1,arr+n+1);
while(Front!=n){
sum=sum+arr[Front]+arr[Front+1];
arr[Front+1]+=arr[Front];
Front++;
sort(arr+Front,arr+n+1);
}
cout<<sum;
return 0;
}