UVa 11321 - Sort! Sort!! Sort!!!

#include <bits/stdc++.h>
#define LL  long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<n;i++)
#define REV(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define pri(a) cout<<a<<endl
#define prii(a,b) cout<<a<<" "<<b<<endl
#define priii(a,b,c) cout<<a<<" "<<b<<" "<<c<<endl
#define hi printf("Hello World\n");
#define pcs printf("CASE# %d:\n", ++cs);
#define WRITE(fn) freopen(fn, "w", stdout);
using namespace std;

/****/ int cs = 0;
const int INF = 1<<29;
const int MX  = 1e5+10;

///** in cmp function take care of whats true according to the problem statement, what you wanna sort in ascending order and by default all others are false..

struct data{
    int nmbr;
    int mod;
};

bool cmp(data a, data b)
{
    if(a.mod < b.mod) return true;

    if(a.mod == b.mod)
    {
        if(a.nmbr%2 && b.nmbr%2 && (a.nmbr > b.nmbr)) return true;
        else if(a.nmbr%2==0 && b.nmbr%2==0 && (a.nmbr < b.nmbr)) return true;
        else if(a.nmbr%2 && b.nmbr%2==0) return true;
    }

    return false;
}

int main()
{
    data ar[MX];

    int n,m,x;

    while(cin>>n>>m)
    {
        cout << n << " " << m << "\n";

        if(n+m==0) break;

        REP(i,n)
        {
            cin>>x;
            ar[i].mod = x%m;
            ar[i].nmbr = x;
        }

        sort(ar,ar+n,cmp);

        REP(i,n)
        {
            cout << ar[i].nmbr << "\n";
        }
    }

    return 0;
}