#include <bits/stdc++.h>

 using namespace std;

 int a[];

 int main()

 {

     int n, m;

     while (cin >> n >> m)

     {

         for (int i = ; i <= n; i++) cin >> a[i];

         sort(a + , a + n + );

         long long ans = ;

         int maxn = a[], cnt = a[] - ;

         for (int i = ; i <= n; i++)

         {

             if (a[i] == a[i - ])

             {

                 if (cnt) { ans += a[i]; cnt--; }

                 else ans += a[i] - ;

             }

             else

             {

                 cnt += a[i] - maxn - ;

                 ans += maxn;

                 maxn = a[i];

             }

         }

         cout << ans << endl;

     }

     return ;

 }