codeforces Round 373 div2 C. Efim and Strange Grade 模拟+ priority_queue

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 ≤ 109) — 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.

被B给坑了，题目看错了，导致没看到C，这是事后做的。

思路是先找到小数点后面所有的能进位的那个位置将它存入priority_queue,然后根据t以及Q里剩余的数目一个个进行进位，如果进的那位在小数点后，就进队，一直维护到t=0或者Q为空，有几个注意点：1、3 1 9.9 结果为10   2、就是要标记最左的那个进位在哪，输出到最左的进位那里即可。

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<vector>
#include<functional>
using namespace std;
const int MAXN=2e5+10;
char str[MAXN];
bool flag[MAXN];
priority_queue<int,vector<int>,greater<int> > Q;
int main()
{
    int n,t;
    while(cin>>n>>t)
    {
        memset(flag,0,sizeof(flag));
        while(!Q.empty())
        {
            Q.pop();
        }
        cin>>str;
        bool f=false;
        int index=n;
        for(int i=0;i<n;i++)
        {
            if(str[i]=='.')
            {
                f=true;
                index=i;
                continue;
            }
            if(f)
            {
                if(str[i]>='5')
                {
                    Q.push(i);
                }
            }
        }
        while(!Q.empty()&&t)
        {
            int s=Q.top();
            Q.pop();
            t--;
            if(s-1!=index)
            {
                str[s-1]++;
                if(str[s-1]>='5')
                {
                    Q.push(s-1);
                }
                flag[s-1]=1;
                str[s]='0';
            }
            else
            {
                str[s-2]++;
                flag[s-2]=1;
                str[s]='0';
            }
        }
        for(int i=n;i>0;i--)
        {
            if(str[i]=='9'+1)
            {
                str[i]='0';
                if(i-1!=index)
                    str[i-1]++;
                else
                    str[i-2]++;
            }
        }
        if(str[0]=='9'+1)
        {
            cout<<1;
            str[0]='0';
        }
        for(int i=0;i<n;i++)
        {
            cout<<str[i];
            if(flag[i])
                break;
        }
        cout<<endl;

    }
}