Pagini recente » Cod sursa (job #1161374) | Cod sursa (job #1733033) | Cod sursa (job #755585) | Cod sursa (job #2733396) | Cod sursa (job #2076104)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("buget.in");
ofstream out("buget.out");
int n, p[100003];
long long b;
long long suma (long long m) {
long long s = 0;
for(int i = 1; i <= n; i++) {
if(p[i] < m) s += p[i];
else s += m;
}
return s;
}
int cautaBinar(int s, int d) {
int mij = (s+d)/2;
if(suma(mij) >= b) return cautaBinar(s, mij-1);
else {
if(suma(mij+1) <= b) return cautaBinar(mij+1, d);
else return mij;
}
}
int main()
{
in >> n >> b;
for(int i = 1; i <= n; i++) {
in >> p[i];
}
out << cautaBinar(0, 2000000000);
return 0;
}