AtCoder Beginner Contest 213 C - Reorder Cards 离散化+排序

AtCoder Beginner Contest 213 C - Reorder Cards 离散化+排序

题
参考

#include
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair pii;
#define pb push_back
#define fi first
#define se second
#define mem(a,x) memset(a,x,sizeof(a));
#define db double 
#define fir(i,a,n) for(int i=a;i<=n;i++)
//======================
const int N=1e5+10;
int h,w,n;
struct node
{
	ll a,b,a1,b1;int i;
}a[N];
bool cmpa(node a,node b)
{
	return a.a					
										


					

						
欢迎分享，转载请注明来源：内存溢出
原文地址: http://outofmemory.cn/zaji/3969724.html