let a[i] stand for the member of party i;
sort it to make a[1]<a[2]<...<a[n]
for i:=1 to (k+1) div 2 do inc(answer,(a[i]+1) div 2);
the answer is sure to be the best one.

I have such sing too,but say me how you write this program I don't understood!