You are viewing a single comment's thread. Return to all comments →
using namespace std;
bool myfuction(string p,string q) { int s,o; s=p.size(); o=q.size(); if(p==q) return p
int main()
{ vectora; int n,i,x; scanf("%d",&n);
for(i=0;i>a[i]; }
sort(a.begin(),a.end(),myfuction);
/*vector:: iterator it;
for(it=a.begin();it!=a.end();it++) { cout<
for(i=0;i
}
brother what i did wrong here;
Seems like cookies are disabled on this browser, please enable them to open this website
Big Sorting
You are viewing a single comment's thread. Return to all comments →
include
include
include
include
include
using namespace std;
bool myfuction(string p,string q) { int s,o; s=p.size(); o=q.size(); if(p==q) return p
int main()
{ vectora; int n,i,x; scanf("%d",&n);
for(i=0;i>a[i]; }
sort(a.begin(),a.end(),myfuction);
/*vector:: iterator it;
for(it=a.begin();it!=a.end();it++) { cout<
for(i=0;i
}