龙卷风摧毁停车场

算法哪里有问题？
用来处理动态链表排序

#include<iostream>
using namespace std;
struct students {
    string name;
    int age;
    int achievement;
};
int main() {
    int n_int;
    cin >> n_int;
    while (n_int > 1000||n_int<0) 
        cin >> n_int;
    students* p = new students[n_int];
    for (int i_for1_int = 0; i_for1_int < n_int; i_for1_int++) {
        cin >> (*(p + i_for1_int)).name;
        cin >> (*(p + i_for1_int)).age;
        cin >> (*(p + i_for1_int)).achievement;
        while ((*(p + i_for1_int)).achievement > 100 || (*(p + i_for1_int)).achievement < 0)
            cin >> (*(p + i_for1_int)).achievement;
    }
    for (int i_for1_int = 0; i_for1_int < n_int-1; i_for1_int++) {
            if ((*(p + i_for1_int)).achievement > (*(p + i_for1_int+1)).achievement) {
                string change_string = (*(p + i_for1_int)).name;
                (*(p + i_for1_int)).name = (*(p + i_for1_int+1)).name;
                (*(p + i_for1_int+1)).name = change_string;
                int change_int = (*(p + i_for1_int)).age;
                (*(p + i_for1_int)).age = (*(p + i_for1_int+1)).age;
                (*(p + i_for1_int+1)).age = change_int;
                change_int = (*(p + i_for1_int)).achievement;
                (*(p + i_for1_int)).achievement = (*(p + i_for1_int+1)).achievement;
                (*(p + i_for1_int+1)).achievement = change_int;
            }else if ((*(p + i_for1_int)).achievement == (*(p + i_for1_int+1)).achievement ) {
                if ((*(p + i_for1_int)).name > (*(p + i_for1_int+1)).name) {
                    string change_string = (*(p + i_for1_int)).name;
                    (*(p + i_for1_int)).name = (*(p + i_for1_int+1)).name;
                    (*(p + i_for1_int+1)).name = change_string;
                    int change_int = (*(p + i_for1_int)).age;
                    (*(p + i_for1_int)).age = (*(p + i_for1_int+1)).age;
                    (*(p + i_for1_int+1)).age = change_int;
                    change_int = (*(p + i_for1_int)).achievement;
                    (*(p + i_for1_int)).achievement = (*(p + i_for1_int+1)).achievement;
                    (*(p + i_for1_int+1)).achievement = change_int;
                }else if ((*(p + i_for1_int)).name == (*(p + i_for1_int+1)).name){
                    if((*(p + i_for1_int)).age > (*(p + i_for1_int)).age){
                        string change_string = (*(p + i_for1_int)).name;
                        (*(p + i_for1_int)).name = (*(p + i_for1_int+1)).name;
                        (*(p + i_for1_int+1)).name = change_string;
                        int change_int = (*(p + i_for1_int)).age;
                        (*(p + i_for1_int)).age = (*(p + i_for1_int+1)).age;
                        (*(p + i_for1_int+1)).age = change_int;
                        change_int = (*(p + i_for1_int)).achievement;
                        (*(p + i_for1_int)).achievement = (*(p + i_for1_int+1)).achievement;
                        (*(p + i_for1_int+1)).achievement = change_int;
                    }
                }
            }
    }
    for (int i_for1_int = 0; i_for1_int < n_int; i_for1_int++) {
        cout << (*(p + i_for1_int)).name << " ";
        cout << (*(p + i_for1_int)).age << " ";
        cout << (*(p + i_for1_int)).achievement << endl;
    }
}