传送门

我们将每一个属性和物品连边，然后枚举从小到大属性跑匈牙利，直到找不到连边

#include <cstdio>#include <cstring>#include <iostream>#define N 1000001#define M 2000001using namespace std;int n, cnt;int head[N], to[M], nex[M], belong[N];bool vis[N];inline int read()inline void add(int x, int y)inline bool dfs(int u)}}return 0;}inline int solve()return ans;}int main()printf("%d\n", solve());return 0;}