Klingon Levels

= Análisis =

= Solución =

C++
/** * Autores :           Juan Pablo Sandoval *                    Rodrigo Claros * * Fecha Publicacion:  9-nov-2009 * **/ using namespace std; typedef priority_queue< int, vector ,greater > c_notas; int main{ int N,K; int nota[100001]; int tam[10001]; int t;    cin>>N; while(N){ bool est[1001] = {0}; c_notas notas; int ult = 0; int n_a; for(int c=0; c>t; tam[c]=t; t+=ult; for(int al = ult; al>n_a; nota[al] = n_a; if(!est[n_a]){ est[n_a] = true; notas.push(n_a); }            }             ult=t; }        ult=0; for(int n=0;n<N;n++){ sort(&nota[ult],&nota[ult+tam[n]]); ult+=tam[n]; }        int max = 0; int pos = 0; int min = 99999999; int cont; int aT; for(int T = notas.top;!notas.empty;T=notas.top, notas.pop){ pos = 0; aT = 0; for(int c=0; c>N; } }
 * 1) include
 * 1) include
 * 1) include
 * 1) include

Java
=Disponible en=