Pagini recente » Cod sursa (job #2584900) | Cod sursa (job #925861) | Cod sursa (job #1469942) | Cod sursa (job #3147881) | Cod sursa (job #389954)
Cod sursa(job #389954)
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
const char iname[]="nums.in";
const char oname[]="nums.out";
const int maxn=100005;
char s[maxn];
struct trie
{
string s;
int v;
} a[maxn];
bool operator<(const trie& a,const trie& b)
{
if(a.s.length()!=b.s.length())
return a.s.compare(b.s)<0;
return a.s.length()<b.s.length();
}
int n,i,j,k;
int main()
{
freopen(iname,"r",stdin);
freopen(oname,"w",stdout);
scanf("%d\n",&n);
for(i=1;i<=n;++i)
{
fgets(s,sizeof(s),stdin);
if(s[0]=='1')
a[++k].s=s,a[k].v=i;
}
sort(a+1,a+k+1);
/*for(i=1;i<=k;++i)
printf("%s",a[i].s.c_str());
*/
fclose(stdin);
fclose(stdout);
return 0;
}