你题目的解答代码如下:
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
long long int a[100001],b[100001];
int pa[100001],pb[100001];
bool comp1(long long int g,long long int h) {
return a[g] < a[h];
}
bool comp2(long long int g,long long int h) {
return b[g] < b[h];
}
int main() {
long long int h,w;
int n,i,j,t,m;
cin >> h >> w >> n;
for (i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
pa[i] = i;
pb[i] = i;
}
sort(pa,pa+n,comp1);
t = 0;
m = -1;
for (i = 0; i < n; i++)
{
if (a[pa[i]] != m)
t++;
m = a[pa[i]];
a[pa[i]] = t;
}
sort(pb,pb+n,comp2);
t = 0;
m = -1;
for (i = 0; i < n; i++)
{
if (b[pb[i]] != m)
t++;
m = b[pb[i]];
b[pb[i]] = t;
}
for (i = 0; i < n; i++)
cout << a[i] << " " << b[i] << endl;
return 0;
}
如有帮助,请点击我的回答下方的【采纳该答案】按钮帮忙采纳下,谢谢!