n,s=map(int,input().split())
v=list(map(int,input().strip().split()))
c=sum(v)
if c<s:print(-1)
else:print(min((c-s)//n,min(v)))//Deeva
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <iomanip>
#include <algorithm>
using namespace std;
#define ll long long int
ll bot=1;
int main()
{
ll n,s,mini=INT_MAX,a=0,b=0;
cin>>n>>s;
vector<ll> v(n,0);
for(ll i=0;i<n;i++)
{
cin>>v[i];
mini=min(mini,v[i]);
a=a+v[i];
}
if(a<s)
{
cout<<"-1";
return 0;
}
for(ll i=0;i<n;i++)
{
b=b+v[i]-mini;
}
b=s-b;
if(b<0)
{
cout<<mini;
return 0;
}
a=b%n;
b=b/n;
if(a!=0)
{
b++;
}
cout<<mini-b;
}2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |