Submission #62129521

---

Source Code Expand

//
//  main.cpp
//  Coding
//
//  Created by admin on 17/01/25.
//
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<utility>
#include<stdlib.h>
#include<limits.h>
#include<cmath>
#include<set>
#include<initializer_list>
#include<unordered_set>
#include<unordered_map>
#include<map>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include <cstdint>

using namespace std;

#define ll long long

int main() {
//    int tc; cin>>tc;
//    while(tc--){
        int n,m; cin>>n>>m;
        string s,t; cin>>s>>t;
        map<char,int> mp;
        string temp = t;
        //sort(s.begin(),s.end());
        sort(t.begin(),t.end());
        
        int i=0,j=m-1;
        while(i<n && j>=0){
            if(s[i]<t[j]){
                mp[t[j]]++;
                s[i] = t[j];
                j--;
            }
            i++;
        }
        if(mp.find(temp[m-1]) == mp.end()){
            s[n-1] = temp[m-1];
        }
        //reverse(s.begin(),s.end());
        cout<<s<<endl;
   // }
}
 

Submission Info

Judge Result