Hdu 1280 (hash)

Typical hash: use an array subscript to represent the sum of the values obtained by adding two to one, and open up an array sum that satisfies the size of the question,

In this way, the subscript can be output from large to small */

[Csharp]
# Include <stdio. h>
# Include <string. h>
Int main ()
{
Int a [3001];
Int sum [10010];
Int n, m;
Int I, j;
While (scanf ("% d", & n, & m )! = EOF)
{
Memset (a, 0, sizeof ());
Memset (sum, 0, sizeof (sum ));
For (I = 0; I <n; I ++)
{
Scanf ("% d", & a [I]);
}

Int temp;
For (I = 0; I <n; I ++)
{
For (j = I + 1; j <n; j ++)
{
Temp = a [I] + a [j];
Sum [temp] ++;
}
}

Int count = 0; // Number of pre-output m
For (I = 10001; I> = 0; I --)
{
If (sum [I])
{
For (j = 0; j <sum [I]; j ++)
{
Count ++;
Count = 1? Printf ("% d", I): printf ("% d", I );
If (count = m)
Break;
}
}
If (count = m)
Break;
}

Printf ("\ n ");
}
Return 0;
}