Submission #29867412


Source Code Expand

#include <bits/stdc++.h>
#define FLASH ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define debt(x,y) cout <<"#x = "<< (x) <<" and "<<"#y = "<<(y)<<endl;
#define deb(x) cout<<"#x = "<< (x) <<endl;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i = 1; i <= n; i++) cout << a[i] << " "; cout << "\n";
#define vecc(a,n) for(ll i = 0; i < n; i++) cout << a[i] << " "; cout << "\n";


using namespace std;

int T;

int main(){
FLASH;
string stroka;
cin >> stroka;
sort(all(stroka));
cout << stroka << endl;




return 0;
}

Submission Info

Submission Time
Task B - Minimize Ordering
User computerbox
Language C++ (GCC 9.2.1)
Score 200
Code Size 652 Byte
Status AC
Exec Time 16 ms
Memory 3752 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 15
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 5 ms 3576 KiB
001.txt AC 16 ms 3748 KiB
002.txt AC 10 ms 3692 KiB
003.txt AC 14 ms 3740 KiB
004.txt AC 6 ms 3740 KiB
005.txt AC 8 ms 3748 KiB
006.txt AC 7 ms 3700 KiB
007.txt AC 7 ms 3708 KiB
008.txt AC 9 ms 3636 KiB
009.txt AC 11 ms 3636 KiB
010.txt AC 8 ms 3744 KiB
011.txt AC 8 ms 3636 KiB
012.txt AC 13 ms 3752 KiB
example0.txt AC 2 ms 3572 KiB
example1.txt AC 2 ms 3620 KiB