Atcoder 3942 2D Plane 2N Points 二分图匹配

一上来我觉得是个贪心,但是我怎么写都写挂.
后来我实在不行了,写了个网络流匈牙利算法过了.

题意

不解释.直接看题.

过程

好像贪心确实是可以过的,但是排序方法要非常骚,不如直接跑网络流.
明明这就是个C题,你们却要这么对它!

#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rec register char
#define rel register ll
#define gc getchar
#define pc putchar
#define p32 pc(' ')
#define pl puts("")
/*By Citrus*/
inline int read(){
  int x=0,f=1;char c=gc();
  for (;!isdigit(c);c=gc()) f^=c=='-';
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return f?x:-x;
  }
template <typename mitsuha>
inline bool read(mitsuha &x){
  x=0;int f=1;char c=gc();
  for (;!isdigit(c)&&~c;c=gc()) f^=c=='-';
  if (!~c) return 0;
  for (;isdigit(c);c=gc()) x=(x<<3)+(x<<1)+(c^'0');
  return x=f?x:-x,1;
  }
template <typename mitsuha>
inline int write(mitsuha x){
  if (!x) return 0&pc(48);
  if (x<0) x=-x,pc('-');
  int bit[20],i,p=0;
  for (;x;x/=10) bit[++p]=x%10;
  for (i=p;i;--i) pc(bit[i]+48);
  return 0;
  }
inline char fuhao(){
  char c=gc();
  for (;isspace(c);c=gc());
  return c;
  }
}using namespace chtholly;
using namespace std;

struct point{
int x,y;
void rd(){x=read(),y=read();}
}a[105],b[105];
int n,pp[105],vis[105],dp[105][105];

int dfs(int p){
for (int i=1;i<=n;++i){
  if (dp[p][i]&&!vis[i]){
    vis[i]=1;
    if (!pp[i]||dfs(pp[i])) return pp[i]=p,1;
    }
  }return 0;
}
int main(){
int i,j;n=read();
for (i=1;i<=n;++i) a[i].rd();
for (i=1;i<=n;++i) b[i].rd();
for (i=1;i<=n;++i){
  for (j=1;j<=n;++j){
    if (a[i].x<b[j].x&&a[i].y<b[j].y) dp[i][j]=1;
    }
  }
int llx=0;
for (i=1;i<=n;++i) memset(vis,0,sizeof vis),llx+=dfs(i);
write(llx);
}