Sorting problems

DdavidDLT (97)
Hey guys, I came across little bit more complicated sorting function. I have results :

Merginos (Females)
111 Roma Liepa 0 51 20
115 Rima Joana 1 29 23
Vaikinai (Males)
256 Zigmas Nosis 0 20 6
213 Petras A. Petraitis 0 38 10
255 Rytis Uosis Ainis 0 39 50

What I need to do is to sort these by their times (starting lowest and increasing) and their gender. Now, luckily, this exercise came out perfectly "sorted". But let's say I'd have like

Merginos
115 Rima Joana 1 29 23
111 Roma Liepa 0 51 20
Vaikinai
213 Petras A. Petraitis 0 38 10
256 Zigmas Nosis 0 20 6
255 Rytis Uosis Ainis 0 39 50

how would I sort that ? I assume you don't need the whole code but I'm gonna link my whole void function (which finds time difference and prints answers)


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
 
void spausdinti_Faila(int n, int m, dalyviai A[], laimetojai B[])
{
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
            if(B[i].kodas == A[j].kodas)
            {
                if(A[j].pS > B[i].pS)
                {
                    B[i].pM--;
                    B[i].pS +=60;
                }
                B[i].pabaigeS = B[i].pS - A[j].pS;

                if(A[j].pM > B[i].pM)
                {
                    B[i].pV--;
                    B[i].pM +=60;
                }

                B[i].pabaigeM = B[i].pM - A[j].pM;
                B[i].pabaigeV = B[i].pV - A[j].pV;
            }

    int laikinasV;
    int laikinasM;
    int laikinasS;

    string laikinasVardas;

    for(int i = 0; i < m - 1; i++)
        for(int j = i + 1; j < m; j++)
        {
            if(B[i].pabaigeV > B[j].pabaigeV)
            {
                laikinasV = B[i].pabaigeV;
                B[i].pabaigeV = B[j].pabaigeV;
                B[j].pabaigeV = laikinasV;
            }
        }


    cout << "Merginos" << endl;
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
            if(B[i].kodas == A[j].kodas)
                if(B[i].lytis == 0)
                    cout << B[i].kodas << " " << A[j].vardas << " " << B[i].pabaigeV << " " << B[i].pabaigeM << " " << B[i].pabaigeS << endl;

    cout << "Vaikinai" << endl;
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
            if(B[i].kodas == A[j].kodas)
                if(B[i].lytis == 1)
                    cout << B[i].kodas << " " << A[j].vardas << " " << B[i].pabaigeV << " " << B[i].pabaigeM << " " << B[i].pabaigeS << endl;
}
keskiverto (10425)
213 Petras A. Petraitis 0 38 10

What are these fields?

dalyviai, laimetojai
What are these types?
jonnin (11495)
are you asking how to do a then-by sort?
it works like you would do it in excel, or by hand...
you sort the list once by gender, for the output you asked.
take that sorted list and split it into 2 new lists, one for males, one for females. Sort the two new lists by time.
generate output:
print males, print all the males in order by time, print females, print them by time...

*because* the initial sort by gender is currently binary, you can avoid the above work and make it more efficient, but that would not work if you had all the PC genders for example, its too many to do that way.
In your binary gender case, just sort by time. After sorting by time, when outputting, pass over the data once for males and a second time for females, only print the one you want each pass, or if you need them split out to do later processing, do a one pass reverse merge type split.
Last edited on
Topic archived. No new replies allowed.