@[Wang_Hez](/user/648626) 加上排序就可以了（求关注喵~
```cpp
#include<bits/stdc++.h>
using namespace std;
long long int n,a[100010],ans=0,f=0;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
if(a[i]-f>0)
{
ans+=6*(a[i]-f);
ans+=5;
f=a[i];
}
if(a[i]-f<0)
{
ans+=4*(abs(a[i]-f));
ans+=5;
f=a[i];
}
if(a[i]==f)
{
ans++;
}
}
ans+=4*f;
f=0;
cout<<ans<<endl;
return 0;
}
```
by Polaris_flame @ 2023-08-27 15:05:41
```cpp
#include<bits/stdc++.h>
using namespace std;
bool cmp(int x,int y){
return x<y;
}
int n,a[100005],c=1,s=0,lc=0; //c要初始化为1哦~
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
if(a[i+1]==a[i]){
c++;
}
else{
s+=(a[i]-lc)*6+5+c;
lc=a[i]; //现在楼层为几楼
c=1;
}
}
s+=lc*4;
cout<<s;
}
by AlexSong @ 2023-08-27 15:08:01
@[Polaris_flame](/user/1046448) 谢谢大佬
by Wang_Hez @ 2023-08-27 15:12:57
@[AlexSong](/user/1004299) 谢谢大佬~
by Wang_Hez @ 2023-08-27 15:13:16
@[Wang_Hez](/user/648626) 记得关注
by AlexSong @ 2023-08-27 16:39:51