Сортировка массива структур по заданному полю

#include<iostream>
#include<string>
#include<math.h>
using namespace std;
struct depatment{ string fio; string post; int homephone; int workphone; int pay; int meantime; }dep[10];
int main()
    string text1, text2;
}
int i, n, k, s, j;
for (i = 0; i < 10; i++)
    cout << "Enter fio of fellow:" << i + 1 << endl;
getline(cin, dep[i].fio, '$');
cout << "Enter post of fellow:" << i + 1 << endl;
getline(cin, dep[i].post, '$');
cout << "Enter homephone of fellow:" << i + 1 << endl;
cin >> dep[i].homephone;
cout << "Enter workphone of fellow:" << i + 1 << endl;
cin >> dep[i].workphone;
cout << "Enter meantime of fellow:" << i + 1 << endl;
cin >> dep[i].meantime;
cout << "Enter pay of fellow:" << i + 1 << endl;
cin >> dep[i].pay;
if (dep[i].meantime > 3);
dep[i].pay * 0.12;
string alph = "ABCDEFGHIKLMNOPQRSTUVWXYZ";
for (i = 0; i < 25; i++);
for (j = 0; j <19; j++);
{text1 = text1.append(dep[i].fio, 0, 1);
 
text2 = alph[i];
n = text1.compare(text2)
if (n == 0){
    cout << "dep[i].fio" << endl;
}
text2.erase();
Text1.erase();

z = dep[k].pay;
        dep[k].pay = dep[k + 1].pay;
        dep[k + 1].pay = z;

swap(dep[k],dep[k+1]);

for (int i = 0; i < n; i++)

for (int i = 0; i < n-1; i++)

for (int k = 0; k < n - 1; k++)

for (i = 0; i < n; i++)
    for (j = 0; j < n-1; j++)
    {
        if (dep[j].fio>dep[j+1].fio)
        {
            depatment buf=dep[j];
            dep[j]=dep[j+1];
            dep[j+1]=buf;
        }
 
 
    }

//#include "stdafx.h"
#include<iostream>
#include<string>
using namespace std;
struct depatment{ string fio; string post; int homephone; int workphone; int pay; int meantime; }dep[10];
int main(){
    int i, n=2, j, z; string text1, text2;
    for (i = 0; i < n; i++){
        cout << "Enter fio of fellow:" << i + 1 << endl;
    getline(cin, dep[i].fio, '$');
    cout << "Enter post of fellow:" << i + 1 << endl;
    getline(cin, dep[i].post, '$');
    cout << "Enter homephone of fellow:" << i + 1 << endl;
    cin >> dep[i].homephone;
    cout << "Enter workphone of fellow:" << i + 1 << endl;
    cin >> dep[i].workphone;
    cout << "Enter meantime of fellow:" << i + 1 << endl;
    cin >> dep[i].meantime;
    cout << "Enter pay of fellow:" << i + 1 << endl;
    cin >> dep[i].pay;
    if (dep[i].meantime > 3)
        dep[i].pay *= 0.12;
}
    
    
    for (i = 0; i < n; i++)
    for (j = 0; j < n-1; j++)
    {
        if (dep[j].fio>dep[j+1].fio)
        {
            depatment buf=dep[j];
            dep[j]=dep[j+1];
            dep[j+1]=buf;
        }
 
 
    }
    for (int i = 0; i < n; i++)
        cout<<dep[j].fio<<endl;
    text2.erase();
    text1.erase();
 
    for (int i = 0; i < n; i++)
    for (int k = 0; k < n - 1; k++)
    if (dep[k].pay < dep[k + 1].pay)
    {
        z = dep[k].pay;
        dep[k].pay = dep[k + 1].pay;
        dep[k + 1].pay = z;
    }
    cout << dep[i].fio << dep[i].pay << endl;
    return 0; 
}

dep[j].fio>dep[j+1].fio

for (int i = 0; i < n; i++)
        cout<<dep[j].fio<<endl;

for (int i = 0; i < n; i++)
        cout<<dep[i].fio<<endl;

double pay;