#include <stdio.h>
#include <iostream>

using namespace std;
unsigned long long compare_counter = 0;
unsigned long long copy_counter = 0;
const int N = 1000;

void copy() {
copy_counter += 3;
}

struct fnp{
    char fam[50];
    char name[50];
    char pat[50];
    int num;
} fnp_sp[50];

void StructInput (int n, fnp) {
setlocale(0, "");
cout << "Ведите ФИО и номер "<< endl;
for (int i = 0; i < n; i++) {
    cin >> fnp_sp[i].fam;
    cin >> fnp_sp[i].name;
    cin >> fnp_sp[i].pat;
    cin >> ftp_sp[i].num;
}
Ccp
int FindMinimumIndex (int Arr[], int n, int min_i, int i){
            for(int j = i + 1; j < n; j++){
                if (Arr[j] < Arr[min_i])
                    min_i = j;
            }
    return min_i;
}

void Swap (int &first_element, int &second_element){
    int vspom;
    vspom = first_element;
    first_element = second_element;
    second_element = vspom;
}

void SelectionSort(int Arr[], int n){
    int min_i;
    int i;
    for( i = 0; i < n; i++){
        min_i = i;
        Swap(Arr[FindMinimumIndex(Arr, n, min_i)], Arr[i]);
}


int main()
{
    setlocale(0, "rus");
    fio pac[N];
    int n, min_i;
    cout<< "Ведите колличество элементов массива : ";
    cin >> n;
     StructInput (n, fnp_sp[50]);
     SelectionSort(fnp_sp[50], n);
     StructOutput(n, fnp_sp[50]);

    return 0;
}