1.#include <a_samp>
2.#include <md-sort>
3.
4.enum playerData {
5.                playa,
6.                progress,
7.                ticks
8.        };
9.new dataPlayer [10][playerData];
10.
11.main()
12.{
13.        print("\n----------------------------------");
14.        print(" Blank Gamemode by your name here");
15.        print("----------------------------------\n");
16.}
17.
18.public OnGameModeInit()
19.{
20.        new progresses[10] = {11, 11, 23, 25, 24, 13, 11, 13, 13, 24};
21.        new tickses[10] = {
22.                1100256,
23.                1698225,
24.                1326999,
25.                1999888,
26.                1122856,
27.                1500000,
28.                1320000,
29.                1698226,
30.                2222222,
31.                222222
32.        };
33.        for (new i = 0; i<10; i+=1) {
34.                dataPlayer [i][playa] = i;
35.                dataPlayer [i][progress] = progresses[i];
36.                dataPlayer [i][ticks]    = tickses[i];
37.        }
38.        print ("Before: ---------------");
39.        for (new i = 0; i<10; i+=1) {
40.                printf ("Raw data: id: %i, progress: %i, ticks: %i",dataPlayer [i][playa],dataPlayer [i][progress], dataPlayer [i][ticks]  );
41.        }
42.
43.        SortArrayUsingComparator(dataPlayer, compareProgress);
44.
45.        print ("After: ---------------");
46.        for (new i = 0; i<10; i+=1) {
47.                printf ("Data after sorting: id: %i, progress: %i, ticks: %i",dataPlayer [i][playa],dataPlayer [i][progress], dataPlayer [i][ticks]  );
48.        }
49.
50.        return 1;
51.}
52.
53.// Remember that simple enum?
54.Comparator:compareProgress(left[playerData], right[playerData]) {
55.        // Calculate the sum of "left" and "right", which are entries in g_TestArray.
56.        new lprog  = left[progress];
57.        new     rprog  = right[progress];
58.        new     lticks = left[ticks];
59.        new rticks = right[ticks];
60.
61.        if (lprog > rprog) return -1;
62.
63.        if (lprog == rprog) {
64.                if (lticks > rticks) return -1;
65.        }
66.        // Returning negative means "left goes above"
67.        // Positive means "left goes below"
68.        return 1;
69.}