Cod sursa(job #587299)
Utilizator | Data | 4 mai 2011 16:45:28 | |
---|---|---|---|
Problema | Grupuri | Scor | 24 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f,*g;
int v[100100];
int n,k,sol,i;
bool ok;
int main() {
f=fopen("grupuri.in","r");
g=fopen("grupuri.out","w");
fscanf(f,"%d%d",&k,&n);
for (i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
ok=true;
sol=0;
while (v[n-k+1]) {
sol++;
for (i=n-k+1;i<=n;i++)
v[i]--;
sort(v+1,v+n);
}
fprintf(g,"%d",sol);
fclose(g);
return 0;
}