UVa OJ - 11462 Age Sort

The following program is my ACcepted code for UVA-11462 .
It's a for everybody to learn and discuss.
If there is any mistake or comment, please let me know.  :D

此乃UVA 11462 的AC code!

歡迎一同討論學習，如有錯誤與任何建議請留言 : )

點這裡看題目 Click here to see this Problem!

此題為簡單的sort ，我使用了 algorithm library 中已經有的sort
因為0<n<=2000000 比較大，所以我把陣列設為全域變數 (main 外面)

This problem use sort. I use the "sort" in algorithm library.
Because 0<n<=2000000, I set the array as global variable. (outside the main function)

//This program is for UVA 11462 Age Sort

//題目來源 Problem link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=26&page=show_problem&problem=2457

#include<stdio.h>

#include<algorithm>

using namespace std;

int age[2000010];

int main()

{

    int n;

    

    while(scanf("%d", &n) && n)

    {

        for(int i = 0; i < n; i++)

            scanf("%d", &age[i]);

        sort(age, age + n);

        

        for(int i = 0; i < (n - 1); i++)

            printf("%d ", age[i]);

        printf("%d\n", age[n - 1]);

    }

    

    return 0;

}

Please feel free to use it after adding this blog as an reference. (http://autekroy.blogspot.tw) If there is any mistake or comment, please let me know. :D 

歡迎使用與分享任何內容，但請記得標示此部落格為出處。(http://autekroy.blogspot.tw/) 如果有發現任何的錯誤與建議請留言或跟我連絡。 : )