cpp/B_Morning_Jogging.cpp at main · igoswamik/cpp · GitHub

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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(int n, int m)
{
    vector<vector<ll>> v;
    vector<ll> A;
    // priority_queue<int, vector<int>, greater<int>> pq;
    for (int i = 0; i < n; i++)
    {
        vector<ll> arr;
        for (int j = 0; j < m; j++)
        {
            ll x;
            cin >> x;
            arr.push_back(x);
            A.push_back(x);
        }
        //sort(arr.begin(), arr.end());
        v.push_back(arr);
    }
    sort(A.begin(), A.end());
    unordered_map<ll, ll> mp;
    for (int i = 0; i < m; i++)
    {
        mp[A[i]]++;
    }

    int idx = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (mp.count(v[i][j]) > 0)
            {
                mp[v[i][j]]--;
                if (mp[v[i][j]] == 0)
                {
                    mp.erase(v[i][j]);
                }
                swap(v[i][j], v[i][idx]);
                idx++;
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cout << v[i][j] << " ";
        }
        cout << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        solve(n, m);
    }
    return 0;
}