Cod sursa(job #197148)
Utilizator | Mari n marin | Data | 2 iulie 2008 08:19:31 |
---|---|---|---|
Problema | Grupuri | Scor | 6 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <stdio.h>
#define DIM 100002
int n,k,s,p,u,m,i;
int A[DIM];
int merge(int x) {
s = 0;
for (i=1;(i<=n);i++) {
if (A[i]<=x) s+=A[i];
else s+=x;
}
if (s<k*x) return 0;
else return 1;
}
int main(){
FILE *f = fopen("grupuri.in","r");
fscanf(f,"%d %d",&k,&n);
for (i=1;i<=n;i++)
fscanf(f,"%d",&A[i]);
fclose(f);
p=1;
u=n+1;
while (p<=u) {
m=(p+u)/2;
if (merge(m))
p=m+1;
else
u=m-1;
}
FILE *g = fopen("grupuri.out","w");
fprintf(g,"%d",u);
fclose(g);
return 0;
}