[2578] Split With Minimum Sum

從DP的相關題連過來還以為爆炸難

完全想錯方向 囧

果然看了討論之後是個easy 題目 T_T

int comp(const void *a, const void *b)

{

return (*(int*)a - *(int *)b);

}

int splitNum(int num) {

int *numArray = calloc (10, sizeof(int));

int idx = 0;

while (num>0)

{

numArray[idx++]= num %10;

num = num/10;

}

qsort (numArray, idx, sizeof(int), comp);

int v1 =0;

int v2 =0;

for (int i=0; i< idx ; i+=2)

{

v1 = v1*10 + numArray[i];

if (i+1<idx)

v2 = v2*10 + numArray[i+1];

}

return v1+v2;

}