2022 information and future preparation 3 new online judge 1059: string sorting

P1059 - String sort - New Online Judgehttp://oj.ecustacm.cn/problem.php?id=1059

Memory limit ：256 MB The time limit ：1 S Standard input and output

Topic type ： Traditional evaluation methods ： Text comparison uploader ： External import

Submit ：208 adopt ：81

Submit Submit the record Statistics Discussion board

Title Description

give n A string , Change the uppercase letters of each string to lowercase letters , Change lowercase letters to uppercase letters , Then output from small to large in dictionary order .

Input format

The first line is a positive integer n(n≤1000)
Next n That's ok , One string per line , Length not exceeding 10, Only upper and lower case letters .

Output format

The output, n That's ok , Output from small to large in dictionary order .

sample input   Copy

3
Abc
bAx
Cx

sample output   Copy

BaX
aBC
cX

Category labels

  Introductory questions

Ideas ：

Water problem , Train of thought . 

AC Code ：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int> 
#define vll vector<ll> 
#define vll2 vector<ll,vector<ll> > 
#define vi2 vector<int,vector<int> > 
#define pii pair<int,int>
#define pll pair<ll,ll>
int main(){
	int tc; cin>>tc;
	string s[tc];
	for(int i=0;i<tc;i++) cin>>s[i];
	for(int i=0;i<tc;i++){
		for(int j=0;j<s[i].size();j++){
			if(s[i][j]<='Z'&&s[i][j]>='A') s[i][j]+='a'-'A';
			else s[i][j]-='a'-'A';
		}
	} 
	sort(s,s+tc);
	for(int i=0;i<tc;i++) cout<<s[i]<<endl;                                                                                                                                                                                                                              
    return 0;
}
//ACplease!!!


/*  printf("                                                                \n");
	printf("                                                                \n");
	printf("       * * *               * * *             * * *             * * *            \n");
	printf("     *       *           *       *         *      *          *       *         \n");
	printf("    *        *          *         *       *        *        *         *        \n");
	printf("            *           *         *                *                  *      \n");
	printf("           *            *         *               *                  *     \n");
	printf("          *             *         *              *                  *       \n");
	printf("         *              *         *             *                  *            \n");
	printf("        *               *         *           *                  *            \n");
	printf("      *                  *       *          *                  *           \n");
	printf("    * * * * * * *          * * *          * * * * * * *      * * * * * * *                           \n");
*/