Codeforces Round #455 (Div. 2)

A. Generate Login
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
The preferred way to generate user login in Polygon is to concatenate a prefix of the user’s first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person.

You are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users).

As a reminder, a prefix of a string s is its substring which occurs at the beginning of s: “a”, “ab”, “abc” etc. are prefixes of string “{abcdef}” but “b” and ‘bc” are not. A string a is alphabetically earlier than a string b, if a is a prefix of b, or a and b coincide up to some position, and then a has a letter that is alphabetically earlier than the corresponding letter in b: “a” and “ab” are alphabetically earlier than “ac” but “b” and “ba” are alphabetically later than “ac”.

Input
The input consists of a single line containing two space-separated strings: the first and the last names. Each character of each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive.

Output
Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well.

Examples
input
harry potter
output
hap
input
tom riddle
output
tomr

理解的是
这两个字符串，第一个字符串必需要第一个字母
然后让第一个字符串第2个字母与第一个字符串的第一个字母比较，直到找到比第二个字符串的第一个字母大的，然后跳出

#include<stdio.h>
#include<stack>
#include<queue>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=100009;
const int inf=0x3f3f3f3f;
#define LL long long
int main()
{
    string s1,s2;
    cin>>s1>>s2;
    string s3="";
    int flag=0;
    s3+=s1[0];
    for(int i=1;i<s1.size();i++)
    {
        if(s1[i]<s2[0])
        {
            s3+=s1[i];
        }
        else
        {
            break;
        }
    }
    s3+=s2[0];
    cout<<s3<<endl;
    return 0;