02:奇数单增序列 个人博客doubleq.win

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstdio>
 4 using namespace std;
 5 int n;
 6 int a[1001];
 7 int tot;
 8 int main()
 9 {
10     cin>>n;
11     int d;
12     for(int i=1;i<=n;i++)
13     {
14         cin>>d;
15         if(d%2==1)
16         {
17             a[i]=d;
18             
19         }
20         else 
21         tot++;
22     }
23     sort(a+1,a+n+1);
24     for(int i=tot+1;i<=n;i++)
25     {
26         if(i==n)
27         cout<<a[i];
28         else 
29         cout<<a[i]<<",";
30     }
31     return 0;
32 }