题意:给你n个点 求第k小的团

思路:暴力bfs+bitset压位

#include
using namespace std;
const int N = 1e5+7;
const int inf = 0x3f3f3f3f;
typedef long long ll;
typedef bitset<107> bs;
struct node{
ll v;
bs t;
friend bool operator < (node a,node b){ return a.v>b.v;
}
};
int n,k;
ll w[107];
bs G[107];
void bfs(){
priority_queue q;
bs t; t.reset();
q.push((node){0,t});
while(!q.empty()){
node tmp=q.top();
q.pop();
k--;
if(k==0){
cout<>n>>k;
for(int i=0;i>w[i];
}
for(int i=0;i>a;
if(a=='1'){
G[i][j]=1;
}
}
bfs();
return 0;
}