/*
* AUTHOR : Hydrolyzed~
* SCHOOL : RYW
* TASK : NOI19_feast
* ALGO :
* DATE :
* */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#ifndef _DEBUG
// @==== Libary ====@ //
// @================@ //
#endif
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
// @=== Debugger ===@ //
#ifdef _DEBUG
#include "debug.hpp"
#else
#define dbg(...) 0
#endif
// @================@ //
using ll = long long;
const int MxN = 300030;
ll a[MxN];
inline void solution(){
int n, k;
cin >> n >> k;
for(int i=1; i<=n; ++i) {
cin >> a[i];
}
ll sum = accumulate(a + 1, a + n + 1, 0ll);
if(n == k) {
cout << sum;
}
else {
cout << sum - *min_element(a + 1, a + n + 1);
}
return ;
}
signed main(){
cin.tie(nullptr)->ios::sync_with_stdio(false);
int q = 1;
// cin >> q;
while(q--){
solution();
cout << "\n";
}
return 0;
}
// https://github.com/MasterIceZ/archive/tree/main/cpp-template
