Submission #24883689

---

Source Code Expand

/*
 * @Author: your name
 * @Date: 2021-08-08 20:21:53
 * @LastEditTime: 2021-08-08 21:09:00
 * @LastEditors: Please set LastEditors
 * @Description: In User Settings Editint 
 * @FilePath: \VScode-c\C_Reorder_Cards.cpp
 */
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
#include <stack>
#include <list>
#include <map>
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define MOD (int)(1e9+7)
#define MAX 100005

using namespace std;

int main()
{
    fast;
    int h, w, n;
    cin >> h >> w >> n;
    vector<int> X, Y;
    queue<pair<int, int>> q;
    for (int i = 0; i < n;i++){
        int x, y;
        cin >> x >> y;
        q.push(make_pair(x, y));
        X.push_back(x);
        Y.push_back(y);
    }
    set<int> t(X.begin(),X.end());
    X.assign(t.begin(), t.end());
    set<int> t1(Y.begin(),Y.end());
    Y.assign(t1.begin(), t1.end());
    while(!q.empty()){
        int x = q.front().first-(q.front().first-(lower_bound(X.begin(), X.end(), q.front().first) - X.begin()+1));
        int y = q.front().second-(q.front().second-(lower_bound(Y.begin(), Y.end(), q.front().second) - Y.begin()+1));
        cout << x << " " << y << endl;
        q.pop();
    }
        return 0;
}

Submission Info

Judge Result