给定若干个数，把其中的素数选出来，并进行排序，从小到大输出
#include<bits/stdc++.h>
using namespace std;
int n, arr[105], m = 0, t;
bool isPrime(int a)
{
if (a < 2) return 0;
if (a == 2 || a == 3) return 1;
for (int i = 2; i * i <= a; i++)
{
if (a % i == 0)
____(1)____;
}
_____(2)_____;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> t;
if (______(3)_____)
{
arr[m++] = t;
}
}
sort(_____(4)______);
for (int i = 0; _____(5)____; i++)
{
cout << arr[i] << " ";
}
cout << endl;
}