mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2025-02-17 15:06:51 +00:00
P3742 umi的函数
R52193557
This commit is contained in:
parent
8b5aa6311c
commit
1ca38e37c8
18
Luogu/problem/P3742/P3742.cpp
Normal file
18
Luogu/problem/P3742/P3742.cpp
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
#include <bits/stdc++.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
int n;
|
||||||
|
string s1, s2, g;
|
||||||
|
cin >> n >> s1 >> s2;
|
||||||
|
for (int i = 0; i < n; i++) {
|
||||||
|
g.push_back(min(s1[i], s2[i]));
|
||||||
|
if (s1[i] < s2[i]) {
|
||||||
|
cout << -1 << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
cout << g << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
x
Reference in New Issue
Block a user