View Code of Problem 126

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct DNA
{
    string a;
    int sum;

};
bool Compare(DNA A,DNA B)
{
    return A.sum<B.sum;
}
int main()
{
    int n,m,i,j,count=0;
    cin>>n>>m;
    vector<DNA> q;
    for(i=0;i<m;i++)
    {
        DNA dna;
        cin>>dna.a;

        q.push_back(dna);
    }
    for(int k=0;k<m;k++)
    {
        count=0;
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                if(q[k].a[i]>q[k].a[j])
                {
                    count++;
                }
            }
        }
        q[k].sum=count;
    }
    sort(q.begin(),q.end(),Compare);
     for(i=0;i<m;i++)
    {
        cout<<q[i].a<<endl;
    }


    return 0;
}

Double click to view unformatted code.


Back to problem 126