锘??xml version="1.0" encoding="utf-8" standalone="yes"?>
#include <iostream>
#include <algorithm>
using namespace std;
int main ()
{
int a[1005];
int t;
scanf ( "%d", &t );
while ( t -- )
{
int n;
scanf ( "%d", &n );
for ( int i = 0; i < n; i ++ )
{
scanf ("%d", &a[i]);
}
sort ( a, a + n );
printf ("%d", a[0]);
for ( int i = 1; i < n; i ++ )
{
printf (" %d",a[i]);
}
printf ("\n");
}
//system ("pause");
return 0;
}
綆鍗曠殑鎺掑簭棰橈紝鐩存帴鍒╃敤sort榛樿鐨勬帓搴忚鍒欙細鍗囧簭鎺掑垪
]]>
Accepted
1280
0MS
292K
1236B
G++
//鍏稿瀷鐨刪ash: 鐢ㄦ暟緇勪笅鏍囪〃紺轟袱涓ょ浉鍔犳墍寰楀埌鐨勫拰錛屽紑杈熶竴涓弧瓚抽鎰忕殑澶у皬鐨勬暟緇?nbsp;sum錛?br>
//榪欐牱涓嬫爣鐢卞ぇ鍒板皬杈撳嚭m涓氨鍙互
#include <iostream>
#include <string>
using namespace std;
int main ()

{
int a[3001];
int sum[10001];
int n, m;
while ( scanf ("%d %d", &n, &m) != EOF )
{
memset ( a, 0, sizeof (a) );
memset ( sum, 0, sizeof (sum) );
for ( int i = 0; i < n; i ++ )
{
scanf ("%d", &a[i]);
}
int temp;
for ( int i = 0; i < n; i ++ )
{
for ( int j = i + 1; j < n; j++ )
{
temp = a[i] + a[j];
sum[temp] ++;
}
}
int count = 0; //杈撳嚭鍓?nbsp;m 涓暟
for ( int i = 10001; i >= 0 ; i -- )
{
if ( sum[i] )
{
for (int 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");
}
// system ("pause");
return 0;
}
鎵浠ユ敼鐢╯ort鎺掑簭鍚庡啀杈撳嚭
Accepted
1280
843MS
17888K
1304B
G++
//鍏稿瀷鐨刪ash: 鐢ㄦ暟緇勪笅鏍囪〃紺轟袱涓ょ浉鍔犳墍寰楀埌鐨勫拰錛屽紑杈熶竴涓弧瓚抽鎰忕殑澶у皬鐨勬暟緇?nbsp;sum錛?br>
//榪欐牱涓嬫爣鐢卞ぇ鍒板皬杈撳嚭m涓氨鍙互
#include <iostream>
#include <string>
using namespace std;
int sum[4500000]; //寮鍏ㄥ眬鏁扮粍鎵嶈兘榪?br>
bool cmp ( const int &a, const int &b )

{
return a > b;
}
int main ()

{
int a[3001];
int n, m;
while ( scanf ("%d %d", &n, &m) != EOF )
{
memset ( a, 0, sizeof (a) );
memset ( sum, 0, sizeof (sum) );
//杈撳叆澶勭悊
for ( int i = 0; i < n; i ++ )
{
scanf ("%d", &a[i]);
}
//涓ゆ暟姹傚拰
//int k = n * ( n - 1 ) / 2;
int temp = 0;
for ( int i = 0; i < n; i ++ )
{
for ( int j = i + 1; j < n; j ++ )
{
sum[temp ++] = a[i] + a[j];
}
}
sort ( sum, sum + temp, cmp );
int count = 0;
for ( int i = 0; i< temp; i ++ )
{
count ++;
count == 1 ? printf ("%d", sum[i]): printf (" %d",sum[i]);
if ( count == m )
break;
}
printf ("\n");
}
// system ("pause");
return 0;
}
]]>