Limak is a little polar bear. He likes nice strings — strings of length n, consisting of lowercase English letters only.
The distance between two letters is defined as the difference between their positions in the alphabet. For example, , and
.
Also, the distance between two nice strings is defined as the sum of distances of corresponding letters. For example, , and
.
Limak gives you a nice string s and an integer k. He challenges you to find any nice string s' that . Find any s' satisfying the given conditions, or print "-1" if it's impossible to do so.
As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to usegets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead ofScanner/System.out in Java.
The first line contains two integers n and k (1 ≤ n ≤ 105, 0 ≤ k ≤ 106).
The second line contains a string s of length n, consisting of lowercase English letters.
If there is no string satisfying the given conditions then print "-1" (without the quotes).
Otherwise, print any nice string s' that .
4 26 bear
roar
2 7 af
db
3 1000 hey
-1
题意:给定一个长度为n的字符串,输出位数相差总数为k的字符串,不存在为-1.(任意答案)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e5+5;
char str[N];
int main()
{
int n,k;
while(~scanf("%d%d",&n,&k))
{
scanf("%s",str);
int maxn = 0;
for(int i = 0;i < n;i++)
maxn += max(str[i]-'a','z'-str[i]);
if(maxn < k)
printf("-1\n");
else
{
int p,q;
for(int i = 0;i < n;i++)
{
p = str[i]-'a',q = 'z'-str[i];
if(k == 0)
putchar(str[i]);
else if(max(p,q) > k)
{
printf("%c",str[i]+k>'z'?str[i]-k:str[i]+k);
k = 0;
}
else
{
printf("%c",p>q?'a':'z');
k -= max(p,q);
}
}
puts("\n");
}
}
return 0;
}