信息学奥赛一本通 1177：奇数单增序列

题目链接：http://ybt.ssoier.cn:8088/problem_show.php?pid=1177

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 510;

int a[N];

int main()
{
    int n;
    scanf("%d", &n);
    
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        int x;
        scanf("%d", &x);
        if (x & 1)
        {
            a[cnt++] = x;
        }
    }
    
    sort(a, a + cnt);
    
    printf("%d", a[0]);
    for (int i = 1; i < cnt; i++)
    {
        printf(",%d", a[i]);
    }
    
    return 0;
}