-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathclass_field_trip.cpp
59 lines (47 loc) · 980 Bytes
/
class_field_trip.cpp
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
//Class Field Trip
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<unordered_set>
#include<cmath>
#include<climits>
#include<queue>
#include<map>
#define FOR(i,a,b) for(int i = a; i < b; i++)
#define FORD(i,a,b) for(int i = b; i >= a; i--)
#define FORE(i,a,b) for(int i = a; i <=b; i++)
#define SIZE(x) x.size()
#define vi vector<int>
#define usi unordered_set<int>
#define si set<int>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a, b;
cin >> a >> b;
string out = "";
int i1, i2;
i1 = i2 = 0;
while(i1 < SIZE(a) && i2 < SIZE(b)){
if(a[i1] < b[i2]){
out += a[i1];
i1++;
}
else{
out += b[i2];
i2++;
}
}
while(i1 < SIZE(a)){
out += a[i1];
i1++;
}
while(i2 < SIZE(b)){
out += b[i2];
i2++;
}
cout << out << endl;
return 0;
}