QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#879771 | #9811. Alphabetical Aristocrats | Sxuanyan | WA | 1ms | 3584kb | C++23 | 768b | 2025-02-02 13:43:04 | 2025-02-02 13:43:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
struct node{
string s;
char str;
}s[1010];
bool cmp(node a , node b){
return a.str<b.str;
}
int main(){
int t;
cin>>t;
for (int i = 0; i < t; i++)
{
getchar();
getline(cin,s[i].s);
}
for (int i = 0; i < t; i++)
{
for (int j = 0; j < s[i].s.size(); j++)
{
if(s[i].s[j]>='A'&&s[i].s[j]<='Z'){
s[i].str=s[i].s[j];
break;
}
}
}
sort(s,s+t,cmp);
// for (int i = 0; i < t; i++)
// {
// cout<<s[i]<<endl;;
// }
for (int i = 0; i < t; i++)
{
cout<<s[i].s<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3584kb
input:
7 van der Steen fakederSteenOfficial Groot Koerkamp Bakker van den Hecken the Younger de Waal van 't Hek
output:
akker an den Hecken the Younger an 't Hek root Koerkamp van der Steen akederSteenOfficial e Waal
result:
wrong answer 1st lines differ - expected: 'Bakker', found: 'akker'