Submission #29873716


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)

std::vector<std::string> split(const std::string& text, const char delim);

using ll = long long int;
using llu = unsigned long long int;

int main(){
    string buffer;
    getline(cin, buffer);
    std::sort(buffer.begin(), buffer.end());
    cout << buffer << endl;

    return 0;
}

std::vector<std::string> split(const std::string& text, const char delim) {
    std::vector<std::string> item_list;
    std::stringstream ss(text);
    std::string buffer;

    while ( std::getline(ss, buffer, delim) ) {
        if (!buffer.empty()) {
                item_list.emplace_back(buffer);
        }
    }

    return item_list;
}

Submission Info

Submission Time
Task B - Minimize Ordering
User low10603
Language C++ (GCC 9.2.1)
Score 200
Code Size 753 Byte
Status AC
Exec Time 32 ms
Memory 3680 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 14 ms 3416 KiB
001.txt AC 20 ms 3548 KiB
002.txt AC 26 ms 3648 KiB
003.txt AC 32 ms 3548 KiB
004.txt AC 8 ms 3564 KiB
005.txt AC 20 ms 3600 KiB
006.txt AC 23 ms 3636 KiB
007.txt AC 27 ms 3544 KiB
008.txt AC 25 ms 3548 KiB
009.txt AC 21 ms 3560 KiB
010.txt AC 20 ms 3680 KiB
011.txt AC 21 ms 3592 KiB
012.txt AC 27 ms 3612 KiB
example0.txt AC 9 ms 3548 KiB
example1.txt AC 2 ms 3460 KiB