Buying A House (Codeforces-796A)

题目链接：

http://codeforces.com/problemset/problem/796/A

A. Buying A House

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Zane the wizard had never loved anyone before, until he fell in love with a girl, whose name remains unknown to us.

The girl lives in house m of a village. There are n houses in that village, lining in a straight line from left to right: house 1, house 2, ..., house n. The village is also well-structured: house i and house i + 1 (1 ≤ i < n) are exactly 10meters away. In this village, some houses are occupied, and some are not. Indeed, unoccupied houses can be purchased.

You will be given n integers a1, a2, ..., an that denote the availability and the prices of the houses. If house i is occupied, and therefore cannot be bought, then ai equals 0. Otherwise, house i can be bought, and ai represents the money required to buy it, in dollars.

As Zane has only k dollars to spare, it becomes a challenge for him to choose the house to purchase, so that he could live as near as possible to his crush. Help Zane determine the minimum distance from his crush's house to some house he can afford, to help him succeed in his love.

Input

The first line contains three integers n, m, and k (2 ≤ n ≤ 100, 1 ≤ m ≤ n, 1 ≤ k ≤ 100) — the number of houses in the village, the house where the girl lives, and the amount of money Zane has (in dollars), respectively.

The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 100) — denoting the availability and the prices of the houses.

It is guaranteed that am = 0 and that it is possible to purchase some house with no more than k dollars.

Output

Print one integer — the minimum distance, in meters, from the house where the girl Zane likes lives to the house Zane can buy.

Examples

input

5 1 20
0 27 32 21 19

output

40

input

7 3 50
62 0 0 0 99 33 22

output

30

input

10 5 100
1 0 1 0 0 0 0 0 1 1

output

20

题目大意：

n套房子在同一条直线上，编号为1-n，每间房子之间的距离为10米，价格已知（价格为0元：表示该房子已被别人购买）女孩住在编号为m的房子里，男孩有k元钱，想买一套房子，需要满足两个条件：1 距离女孩的房子最近 2 价格<=k元。题目要求输出最终男孩买的房子距离女孩房子的距离。第一行输入n m k，加下来n个整数表示每套房子的价格。

解题思路：

水题，这道题不会做应该是题意不懂，建议大家明白题意后，自己编写代码。

代码：

#include<iostream>
using namespace std;
int main()
{
    int n,m,k,a[110];
    while(cin>>n>>m>>k)
    {
        for(int i=0;i<=n-1;i++)
            cin>>a[i];
        int left=0,right=0;
        int zr=0,zl=0;
        for(int i=m;i<=n-1;i++)
        {
            right=right+10;
            if(a[i]<=k&&a[i]!=0)
            {
                zr=1;
                break;
            }
        }
        for(int i=m-2;i>=0;i--)
        {
            left=left+10;
            if(a[i]<=k&&a[i]!=0)
            {
                zl=1;
                break;
            }
        }
        if(zr==0)
            cout<<left<<endl;
        else if(zl==0)
            cout<<right<<endl;
        else
            cout<<min(right,left)<<endl;
    }
    return 0;
}