4. Darbsciausi mokinaiai sort by alphabet and by sum

#include "pch.h"
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <iomanip>
#include "N.D.h"
using namespace std;

struct asmuo
{
	string vardas;
	int sk[99];
	int skf = 0;
	int X;
};
int n = 0, k = 0;
asmuo m[222];
void skaitymas(int &n, int &k);
void skaiciavimas(int n, int k);

int main()
{
	skaitymas(n, k);
	skaiciavimas(n, k);
}
void skaitymas(int &n, int &k)
{
	ifstream d("duom.txt");
	d >> n >> k;
	d.ignore();
	char x[15];
	for (int i = 1; i <= n; i++)
	{
		d.get(x, 15);
		m[i].vardas = x;
		for (int j = 1; j <= k; j++)
		{
			d >> m[i].sk[j];
			d.ignore();
		}
	}
}

void skaiciavimas(int n, int k)
{
	for (int i = 1; i <= n; i++)
	{
		m[i].X = i;
		for (int j = 1; j <= k; j++)
		{
			m[i].skf += m[i].sk[j];
		}
	}

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if ((m[i].vardas < m[j].vardas) || ((m[i].vardas == m[j].vardas) && (m[i].skf < m[j].skf)))
			{
				swap(m[i].vardas, m[j].vardas);
				swap(m[i].skf, m[j].skf);
				swap(m[i].X, m[j].X);
			}
		}
	}
	for (int i = 1; i <= n; i++)
	{
		cout << m[i].vardas;
		for (int j = 1; j <= k; j++)
		{
			cout << m[m[i].X].sk[j];
		}
		cout << endl;

		cout << m[i].vardas << m[i].skf << endl;
	}
}