mesaj1

#include <fstream>
#include <algorithm>
using namespace std;

ifstream cin ("mesaj1.in");
ofstream cout ("mesaj1.out");
char mat[2000][26],frv[26];
struct pc{
    int poz;
    char car;
} v[26];
int cmp(pc a,pc b){
    if (a.car<b.car)
        return 1;
    else
        return 0;
}
int main()
{
    int i,col,lin,n,mar,mar2,j,max1;
    char a;
    string s,sd,aux;
    cin>>mar>>sd>>mar2>>s;
    getline(cin,aux);
    s+=aux;
    for (i=0;i<sd.size();i++){
        v[i].car=sd[i];
        v[i].poz=i;
    }
    sort (v, v+sd.size(),cmp);
    n=mar2/mar;
    if (mar2%mar>0)
        n++;
    j=0;
    for (i=0;i<sd.size();i++){
        n=mar2/mar;
        if(mar2%mar!=0 && v[i].poz<mar2%mar)
            n++;
        for (lin=0;lin<n;lin++){
            mat[lin][v[i].poz]=s[j];
            j++;
        }
    }
    max1=2000;
    for(i=0;i<s.size();i++){
        frv[s[i]-'A']++;
    }
    for(i=0;i<26;i++){
        if(frv[i]>0 && frv[i]<max1){
            a=i+'A';
            max1=frv[i];
        }
    }
    cout<<a<<"\n";
    if(mar2%mar==0)
        n++;
    for (lin=0;lin<n-1;lin++){
        for (col=0;col<sd.size();col++){
            cout<< mat[lin][col];
        }
    }
    for (col=0;col<mar2%mar;col++){
        cout<< mat[lin][col];
    }
    return 0;
}