Codeforces 719C Efim and Strange Grade【贪心】

C. Efim and Strange Grade

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Efim just received his grade for the last test. He studies in a special school and his grade can be equal to any positive decimal fraction. First he got disappointed, as he expected a way more pleasant result. Then, he developed a tricky plan. Each second, he can ask his teacher to round the grade at any place after the decimal point (also, he can ask to round to the nearest integer).

There are t seconds left till the end of the break, so Efim has to act fast. Help him find what is the maximum grade he can get in no more than t seconds. Note, that he can choose to not use all t seconds. Moreover, he can even choose to not round the grade at all.

In this problem, classic rounding rules are used: while rounding number to the n-th digit one has to take a look at the digit n + 1. If it is less than 5 than the n-th digit remain unchanged while all subsequent digits are replaced with 0. Otherwise, if the n + 1 digit is greater or equal to 5, the digit at the position n is increased by 1 (this might also change some other digits, if this one was equal to 9) and all subsequent digits are replaced with 0. At the end, all trailing zeroes are thrown away.

For example, if the number 1.14 is rounded to the first decimal place, the result is 1.1, while if we round 1.5 to the nearest integer, the result is 2. Rounding number 1.299996121 in the fifth decimal place will result in number 1.3.

Input

The first line of the input contains two integers n and t (1 ≤ n ≤ 200 000, 1 ≤ t ≤ 10⁹) — the length of Efim's grade and the number of seconds till the end of the break respectively.

The second line contains the grade itself. It's guaranteed that the grade is a positive number, containing at least one digit after the decimal points, and it's representation doesn't finish with 0.

Output

Print the maximum grade that Efim can get in t seconds. Do not print trailing zeroes.

Examples

Input

6 1
10.245

Output

10.25

Input

6 2
10.245

Output

10.3

Input

3 100
9.2

Output

9.2

Note

In the first two samples Efim initially has grade 10.245.

During the first second Efim can obtain grade 10.25, and then 10.3 during the next second. Note, that the answer 10.30 will be considered incorrect.

In the third sample the optimal strategy is to not perform any rounding at all.

题目大意：

给你一个长度为N的浮点数，然后你可以任意选取一位作为四舍五入的位子，然后向前进位，你可以进行这种操作t次，问t次后最大的数是多少。

思路：

其实t那么大就是吓唬人的，我们最多也就是进位字符串长度那么多次。

我们考虑贪心，从左到右遍历小数点之后的位子，找到第一个大于等于5的位子，作为第一次进位的位子，这样能够使得当前进位最优化。

继而从局部最优可以得到整体最优，所以我们贪心的思路是没有问题的，那么对于第一个进位的位子进位之后，只要考虑其前边一个位子是否能够继续进位即可，如果不能进位了，直接退出即可（因为再往前肯定没有能够进位的位子了）。反则我们继续进位直到不能进位位子。

注意整体进位结束之后，我们还需要调整小数点之前的进位情况。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char b[1500000];
int a[1500000];
int main()
{
    int n,t;
    while(~scanf("%d%d",&n,&t))
    {
        int pos=n-1;
        int flag=0;
        scanf("%s",b);
        for(int i=0;i<n;i++)
        {
            if(b[i]>='5'&&flag==1)
            {
                pos=i;
                break;
            }
            if(b[i]=='.')flag=1;
        }
        for(int i=0;i<n;i++)
        {
            if(b[i]=='.')a[i]=-1;
            else a[i]=b[i]-'0';
        }
        while(t>0)
        {
            if(a[pos]>=5)
            {
                pos--;
                if(a[pos]!=-1)
                {
                    a[pos]++;
                }
                else
                {
                    pos--;
                    a[pos]++;
                    break;
                }
            }
            else break;
            t--;
        }
        for(int i=pos;i>0;i--)
        {
            if(a[i]==10)
            {
                a[i]=0;
                a[i-1]++;
            }
        }
        for(int i=0;i<=pos;i++)
        {
            if(a[i]==-1)printf(".");
            else
            printf("%d",a[i]);
        }
        printf("\n");
    }
}