Submission #3440606


Source Code Expand

#include<iostream>
#include<string>
using namespace std;

int main()
{
        string s,t;
        cin >> s;
        cin >> t;
        for(int i=0;i<s.size();++i){
                int minc = 0;
                for(int j=i;j<s.size();++j){
                        if(s[minc]<s[j]){
                                minc = j;
                        }
                char tmp = s[i];
                s[i] = s[minc];
                s[minc] = tmp;
                }
        }
        for(int i=0; i<t.size();++i){
                int maxc = 0;
                for(int j=i;j<t.size();++j){
                        if(t[maxc]>t[j]){
                                maxc = j;
                        }
                char tmp = t[i];
                t[i] = t[maxc];
                t[maxc] = tmp;
                }
        }
        if(s<t){
                cout << "Yes\n";
        }else{
                cout << "No\n";
        }
}

Submission Info

Submission Time
Task B - Two Anagrams
User lisbun
Language C++14 (GCC 5.4.1)
Score 200
Code Size 966 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 5
AC × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB