二分静态查找

这里有个问题：在结构体中定义一个int类的数组，如何在做类似于int a[]={1,2,3}的集成初始化

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
/*
  二分静态查找 
  前提：1.有序；2.连续存储 
*/
typedef struct{
	int array[MAXSIZE];
	int lenth;
}StaticTable;
int binarySearch(StaticTable* tbl,int k);
int main(){
	StaticTable *tbl=(StaticTable*)malloc(sizeof(StaticTable));
	//tbl->array[MAXSIZE]={1,3,4,8,10,13,30,33};
	tbl->array[0]=1;
	tbl->array[1]=3;
	tbl->array[2]=4;
	tbl->array[3]=8;
	tbl->array[4]=10;
	tbl->array[5]=13;
	tbl->array[6]=30;
	tbl->array[7]=33;
	//tbl->array = {1,3,4,8,10,13,30,33};
	tbl->lenth=8;
	int idx=binarySearch(tbl,30);
	
	return 0;
}
int binarySearch(StaticTable* tbl,int k)
{
	int left,mid,right;
	left=0;right=tbl->lenth-1;
	while(left<=right)
	{
		mid=(left+right)/2;
		if(k>tbl->array[mid])
		{
			left=mid+1;
		}else if(k<tbl->array[mid])
		{
			right=mid-1;
		}else
		{
			return mid;
		}
	}
	return -1;	
}