Submission #815094
Source Code Expand
Copy
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define ff first #define ss second #define sz size() #define all(a) a.begin(), a.end() #define allr(a) a.rbegin(), a.rend() #define mod 1000000007 #define _for(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it) using namespace std; int main(){ int N, M; cin >> N >> M; vector<string> s; string t; for(int n = 1; n <= N; ++n){ cin >> t; s.pb(t); } sort(all(s)); for(int n = 0; n < s.sz; ++n){ cout << s[n]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Iroha Loves Strings (ABC Edition) |
User | achaitanyasai |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 599 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt |
All | subtask0_sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 4 ms | 256 KB |
subtask1_01.txt | AC | 4 ms | 256 KB |
subtask1_02.txt | AC | 4 ms | 256 KB |
subtask1_03.txt | AC | 4 ms | 256 KB |
subtask1_04.txt | AC | 6 ms | 256 KB |
subtask1_05.txt | AC | 4 ms | 256 KB |
subtask1_06.txt | AC | 5 ms | 256 KB |
subtask1_07.txt | AC | 5 ms | 256 KB |
subtask1_08.txt | AC | 4 ms | 256 KB |
subtask1_09.txt | AC | 4 ms | 256 KB |