前m大的数 hdu1280 (hash)

//强大的hash 时间相差好多啊！！
#include<iostream>//2551148 2010-06-21 00:59:31 Accepted 1280 15MS 288K 843 B C++ 悔惜晟
#include<cstdio>
using namespace std;

int hash[10001];
int a[3005];

int main()
{
 int n, m;
 while(scanf("%d %d", &n, &m) != EOF)
 {
  int i, j, count = 0, k;
  for(i = 0; i < n; i++)
   scanf("%d", &a[i]);
  memset(hash, 0, sizeof(hash));
  for(i = 0; i < n - 1; i++)
  for(j = i + 1; j < n; j++)
  {
   hash[ a[i] + a[j] ]++;
  }
  for(i = 10000; i >= 0; i--)
  {
   if(hash[i] == 0)
    continue;
   else if(hash[i] == 1)
   {
    count++;
    if(count != m)
     printf("%d ", i);
    else
    {
     printf("%d/n", i);
     break;
    }
   }
   else
   {
    k = hash[i];
    while(k--)
    {
     count++;
     if(count != m)
     printf("%d ", i);
     else
     {
      printf("%d/n", i);
      break;
     }
    }
    if(count == m)
     break;
   }
  }
 }
}

//2272848 2010-03-31 18:44:28 Accepted 1280 656MS 17868K 609 B C++ 悔惜晟
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX = 4498501;

struct stu
{
    int sum;
}df[MAX];

int cmp(stu a, stu b)
{
    return a.sum > b.sum;
}

int main()
{
    int n, m, a[3001];
    while(scanf("%d %d", &n, &m) != EOF)
    {
        int i, j;
        for(i = 0; i < n; i++)
            scanf("%d", &a[i]);
        int count =0;
        for(i = 0; i < n - 1; i++)
            for(j = i+1; j < n ;j++)
                df[count++].sum = a[i] + a[j];
        sort(df,df+count, cmp);
        for(i = 0 ; i < m ; i++)
        if(i != m - 1)   
            printf("%d ", df[i].sum);
        else
            printf("%d/n", df[i].sum);

    }

}