Submission

Status:
[-SSSSSSSSS]

Score: 0

User: Cmoss9

Problemset: เรียงสตริง

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-11 22:05:51

#include <bits/stdc++.h>
using namespace std;
int main () {
    string a,b;
    cin >> a >> b;
    int longest = a.size();
    if (a.size() < b.size()) {
        longest = b.size();
    }
    int index = 0;
    char arr[longest];
    for (int i = 0;i<longest;i++) {
        int nigg = 0;
        for (int j = 0;j<longest;j++) {
            if (a[i] == b[j]) {
                for (int k = 0;k<index;k++) {
                    if (arr[k] == b[j]) {
                        nigg = 1;
                    }
                }
                if (nigg) break;
                arr[index] = a[i];
                index++;
            }
        }
    }
    sort(arr,arr+index);
    for (int i = 0;i<index;i++) {
        cout << arr[i] << " ";
    }
}