here

include<bits/stdc++.h>

using namespace std;
int main(){
int n,k,dem=1;
cin>> n>>k;
int a[999];
for(int i=0;i<n;i++){ cin >> a[i];
}
sort(a,a+n);
if(a[n-1]>=k)
dem+=abs(a[n-1]-k);
//a.pop_back();
for(int i=0;i<n-1;i++){
dem+=a[i];
}
cout << dem;
return 0;
}

Blackpink in your area
Fan cuong Blackpinkk

Xin chào mọi người (☞ﾟヮﾟ)☞☜(ﾟヮﾟ☜)

Để thắng cuộc, bạn cần cả kỹ năng và ý chí. – Frank Tyger!

‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌

include <iostream>

include <math.h>

include <algorithm>

include <climits>

include <queue>

include <vector>

include <stack>

include <string>

include <iomanip>

include <tuple>

include <set>

include <map>

using namespace std;

define int long long

const int MAXN = 300005;
int a[MAXN];
int s;
int n;

void solve(){
cin >> n >> s;
for(int i = 1 ; i <= n ;i++){
cin >> a[i];
}
int i = 1;
int j = n ;
while(i <= j){
if(a[i] + a[j] < s){
i++;
}else if(a[i] + a[j] > s){
j--;
}else if(a[i]+a[j] == s){
cout << i << " " << j << endl;
return;
}
}
cout << "No solution" << endl;
return;

}

signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t=1;
// cin >> t;
while(t--){
solve();
}
return 0;
}

2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
import random

def is_prime(n, k=5):
if n <= 1:
return False
if n == 2 or n == 3:
return True
if n % 2 == 0:
return False

for i in range(k):
    a = random.randint(2, n-1)
    if pow(a, n-1, n) != 1:
        return False

return True

SigmaNotFound : https://www.youtube.com/shorts/_aaoIQqBMHs

Always be yourself, express yourself, have faith in yourself, and do not go out and look for a successful personality and duplicate it.