Codeforce718A By Assassin

A. 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

思路很简单。。。基本上上写在代码里了，整体就是注意细节。。。算是模拟吧

注意我们每次只要找到第一个在.之后的大于4的位置，然后往前更新就好，而且这样前面不会出现9+1的情况

代码

#include<bits/stdc++.h>
#define input freopen("input.txt","r",stdin)
using namespace std;
int main()
{
	input;
	string s;
	int a[200002],i,j;
	long long n,t,pos,zheng,dian;
	while(cin>>n>>t)
	{
		cin>>s;
		pos=-1;
		dian=2000002;
		zheng=0,jin=0;
		for(i=0;i<n;i++)
		{
			if(pos==-1&&i>dian&&s[i]>='5'&&s[i]!='.')  //找到第一个大于4的位置 
			{
				pos=i;
			}
			if(s[i]!='.') a[i]=s[i]-'0';       //用int数组存储，方便更新 
			else 		  {a[i]=-1;dian=i;}    // 找到点的位置 
		}
		while(pos>0&&a[pos]!=-1)    //要保证pos！=-1如果pos==-1说明不需要变 
		{
			if(t<=0)break;    //次数小于1弹出 
			if(a[pos]>=5)     //当前位置大于5 
			{
				if(a[pos-1]==-1)    //前一个点是. 标记整数部分进1 
				{
					zheng=1;
					break;
				}
				else                //否则前一位+1（因为pos之前时第一个大于等于5的，就保证前面不会出现9+1的情况） 
				{
					a[pos-1]+=1;
				}
				pos--;
				t--;
			}
			else 
			{
				break;
			}
		}
		int tmp;
		if(pos==-1)    //直接输出 
		{
			for(i=0;i<n;i++)cout<<s[i];
			cout<<endl;
		}
		else if(zheng==1)   //整数进1说明只需要整数 
		{
			for(i=dian-1;i>=0;i--)
			{
				tmp=a[i];
				a[i]=(a[i]+zheng)%10;
				zheng=(tmp+zheng)/10;
			}			
			if(zheng==1)cout<<1;
			for(i=0;i<dian;i++)cout<<a[i];
			cout<<endl;
		}
		else   //就是一般情况，直接输出pos及其之前的就行了 
		{
			for(i=0;i<=pos;i++)
				if(a[i]!=-1)cout<<a[i];
				else cout<<'.';
			cout<<endl;
		}

	} 
	return 0;
}