https://codeforces.com/contest/1061/problem/B
ll a[maxn],b[maxn];
int main(){
cin>>n>>m;
ll sum=0,maxx=0;
rep(i,1,n){
cin>>a[i];
sum+=a[i];
maxx=max(maxx,a[i]);
}
if(n==1)
return cout<<0<<endl,0;
sort(a+1,a+n+1);
cnt=1;
for(int i=1;i<=n;i++){
if(a[i]<cnt) //随便留一个
ans++;
else
cnt++; //留的maxx的一份子
}
cout<<sum-ans-maxx<<endl;
return 0;
}