Cod sursa(job #1076675)
Utilizator | FMI Stanescu Leonard Wyvern | Data | 10 ianuarie 2014 14:52:08 |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("grupuri.in");
ofstream fo("grupuri.out");
int n, k, a[100001];
long long sum;
int caut(int n,int k,long long sum)
{
if ((n<1)||(k<=0))
return 0;
if (a[n]<=sum/k)
return sum/k;
return caut(n-1,k-1,sum-a[n]);
}
int main()
{
fi>>k>>n;
for (int i=1;i<=n;i++) {
fi>>a[i];
sum=sum+a[i];
}
fo<<caut(n,k,sum);
return 0;
}