结对合作-乘坐电梯的所有乘客爬楼梯的层数之和最少

#include<iostream.h>
int main()
{
    int floor[19]={0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0},j,k,x=1;
    int sum,temp=0;
    for(k=1;k<=18;k++)
    {
        for(j=1;j<k;j++)
        {
            if(floor[j]==0)
            {
                continue;
            }
            else
            {
                temp+=(k-j)*floor[j];
            }
        }
        for(j=k+1;j<=18;j++)
        {
            if(floor[j]==0)
            {
                continue;
            }
            else
            {
                temp+=(j-k)*floor[j];
            }
        }
        if(k==1)
        sum=temp;
        if(temp<=sum)
        {
            sum=temp;
            x=k;
        }
        temp=0;
    }
    cout<<x;
}