求调 为啥样例过不了啊

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<bits/stdc++.h>


using namespace std;

#define itn int
#define ll long long
#define ull unsigned long long
#define ff()  for(int i=1;i<=n;i++)

const int maxn=114514;


int  n,m,num;
int  a[maxn];
int b[maxn];
int k;
ll ans=0;

inline int read(){//神奇的读优
    int h_=1,d_=0;char t_=getchar();
    while(t_<'0' || t_>'9'){if(t_=='-')h_=-1;t_=getchar();}
    while(t_>='0' && t_<='9'){d_=d_*10+t_-'0';t_=getchar();}return h_*d_;
}
void print(int x_){//快输
    if(x_<0){
        putchar('-'),x_=-x_;
    }
    if(x_>9){
        print(x_/10);
    }
    putchar(x_%10+'0');
    return ;
}


void he(int l,int mid,int r){
    int i=l;
    int j=mid+1;
    int k=l;
    while(i<=mid&&j<=r){//合并数组
        if(a[i]<a[j]){//第一种情况a[i]<a[j]
            b[k++]=a[i++];
        }else{//第二种情况a[i]>=a[j]
            b[k++]=a[j++];
        }
    }
    while(i<=mid){
        b[k++]=a[i++];
    }
    while(j<=r){
        b[k++]=a[j++];
    }
    for(int f=l;f<=r;f++){//赋值
        a[f]=b[f];
    }
}
void fen(int l,int r){
    if(l==r)return ;
    int mid=l+(r-l)/2;
    fen(l,mid);//分区1
    fen(mid+1,r);//分区2
    he(l,mid,r);//再和一遍
}


bool isprime(int x)
{
	
	for(itn i=2;i*i<=x;i++)
	{
		if(x%i==0)
		{
			return 0;
		}
	}
	return 1;
	
}



signed main(){
	cin>>n>>k;
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	int  u=1<<n;
	for(int i=0;i<u;i++)
		if(__builtin_popcount(i)==k){
			
			for(int j=0;j<n;j++)
			{
				if(i&(1<<j))num+=a[j]; 
			}
			if(isprime(num))ans++;
		}
	cout<< ans;
	
}