HackerRank/Richie Rich.cpp at master · sashaen/HackerRank · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// https://www.hackerrank.com/challenges/richie-rich

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int n;
    int k;
    cin >> n >> k;
    string number;
    cin >> number;
	string result = number;
	for(int i = 0; i<result.length()/2; i++)
	{
		if(result[i]!=result[result.length()-i-1])
		{
			result[i]=max(result[i], result[result.length()-i-1]);
			result[result.length()-i-1]=max(result[i], result[result.length()-i-1]);
			k--;
		}
	}
	if(k<0)
	{
		cout<<"-1";
		return 0;
	}
	int i = 0;
	while(k>0&&i<result.length()/2)
	{
		if(result[i]=='9')
		{
			i++;
			continue;
		}
		else
		{
			if(result[i]!=number[i]||result[result.length()-i-1]!=number[result.length()-i-1])
			{
				result[i] = '9';
				result[result.length()-i-1]='9';
				k--;
				i++;
			}
			else
			{
				if(k<2)
				{
					i++;
					continue;
				}
				result[i] = '9';
				result[result.length()-i-1]='9';
				k-=2;
				i++;
			}
		}
	}
	if(k>0&&result.length()%2==1)
	{
		result[result.length()/2]='9';
	}
	cout<<result;

    return 0;
}