#include<bits/stdc++.h>/*#include <stdio.h>
#include <algorithm>
#include<iostream>
#include <stdlib.h>*///#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
typedef long long ll;const int maxn=1e6+50;const int N=1e6+5;const ll mod =1e9+7;const int inf=2e9+7;
using namespace std;
priority_queue<int,vector<int>,greater<int>> q;
int a[30005],ans[5000010],topa,topans,next[5000010];
int main(){
int l,m;
cin>>l>>m;memset(ans,0x3f,sizeof(ans));//先将ans设置最大,删除时如果是递减序列方便特判。
q.push(1);while(1){
int x=q.top(),d=0;q.pop();
q.push(2*x+1);q.push(4*x+5);
a[++topa]=x;//记录输入的数while(x){
d=d*10+x%10;
x/=10;}//反向拆解while(d){
ans[++topans]=d%10;
d/=10;}//将数字一位位加入ansif(topa>=l)break;//到限度停止加入}for(int i=1;i<=topa;i++) cout<<a[i];
cout<<endl;for(int i=0;i<topans;i++) next[i]=i+1;//模拟链表,记录当前位的下一位的位置,方便比较,就不用删数了while(m){
int l=0;while(ans[next[l]]>=ans[next[next[l]]])//末尾不用特判,因为一定不会比0x3f大
l=next[l];//直到出现前比后小
next[l]=next[next[l]];
m--;}for(int i=0;next[i];i=next[i]) cout<<ans[next[i]];return0;}
字符串贪心做法
#include<bits/stdc++.h>/*#include <stdio.h>
#include <algorithm>
#include<iostream>
#include <stdlib.h>*///#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
typedef long long ll;const int maxn=1e6+50;const int N=1e6+5;const ll mod =1e9+7;const int inf=2e9+7;
using namespace std;
ll num[310000];
int main(){
int k,m;
cin>>k>>m;
num[1]=1;
int s1=1,t1=1;for(int i=2;i<=k;i++){
int q=2*num[s1]+1;
int w=4*num[t1]+5;if(q<w){
s1++;
num[i]=q;}elseif(q==w){
s1++;t1++;
num[i]=q;}else{
t1++;
num[i]=w;}}for(int i=1;i<=k;i++) cout<<num[i];
cout<<endl;
string s="";for(int i=1;i<=k;i++){
stringstream ss;
ss<<num[i];
string str;
ss>>str;
s+=str;}
string::iterator it =s.begin();s.insert(it,'9');
int r=0;
int n=s.size();
int sum=0;
int h=1;while(h<=n&&sum!=m){if(s[h]<=s[r]){
s[++r]=s[h++];}else
r--,sum++;}while(h<=n) s[++r]=s[h++];for(int i=1;i<n-m;i++) cout<<s[i];
cout<<endl;return0;}