5-Topshiriq On programming contests each team consists of three people and has a name. Write a program that for a team name and surnames of the participants, the full name of the team builds

string a[3];
for (int i=0; i<3; i++) cin>>a[i];
for (int i=0; i<3; i++)
for (int j=0; j<3; j++)
if (a[i] < a[j]){
swap(a[i], a[j]);
}
cout << s << "(";
for (int i=0; i<3; i++)
if (i != 2) cout << a[i] << ", ";
else cout << a[i];
cout << ")" << endl;
}



6-Topshiriq
The array is sorted with selection sort in ascending order. How many times does the first element in initial array change its position?
Input
The first line contains the number of elements in array n (1 ≤ n ≤ 1000). The second line contains the elements of array. It is known that all elements in array are different and not greater than 10⁹ by absolute value.
Output
Print the number of movements of the first element.
Samples

№	Input	Output
1	3 1 3 2	0
2	2 2 1	1
3	4 4 1 5 3	3

#include
using namespace std;
int main() {
int n; cin>>n;
int a[n]; int s=0;
for (int i = 0; i < n; i++) cin>>a[i];
int fst = a[0];
for (int i = 0; i < n-1; i++) {
int minPos = i;
for (int j = i+1; j < n; j++)
if (a[j] < a[minPos])
{
if (fst == a[i] || fst == a[j]) s++;
minPos = j;
}
swap(a[i], a[minPos]);
}
cout << s << endl;


}





10-Topshiriq
N ta son berilgan. Ulardan shunday uchtasini tanlash kerakki, ularning ko’paytmasi maksimal bo’lsin.


Kiruvchi ma’lumotlar
Birinchi qatorda N butun soni beriladi(3 ≤ n ≤ 1000). Ikkinchi qatorda N ta son bitta probel bilan ajratilgan holda beriladi. Ularning qiymatlari butun va modul jihatidan 10⁶ dan oshmaydi.
Chiquvchi ma’lumotlar
Bitta butun sonni – maksimal ko’paytmaning qiymatini chiqaring.
Misollar

№	Kiruvchi ma’lumotlar	Chiquvchi ma’lumotlar
1	5 5 6 -9 4 3	120
2	3 -5 -7 -2	-70

#include
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin>>a[i];
for (int i = n-1; i >= 1; i--) {
for (int j = 0; j < i; j++) {
if (a[j] < a[j+1]) {
swap(a[j], a[j+1]);
}
}
}
cout << a[0]*a[1]*a[2];
}