atrinkti vienodud=s

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

struct manksta
{
    string p;
    int kiek;
};

manksta A[100], B[100];

void reading(int& n, manksta A[]);
void atrinkti(int n, manksta A[], manksta B[]);

int main()
{
    int n = 0;
    reading(n, A);
    atrinkti(n, A, B);
}

void reading(int& n, manksta A[])
{
    ifstream d("duom.txt");

    d >> n;
    d.ignore();
    char t[21];

    for (int i = 0; i < n; i++)
    {
        d.get(t,21);
        A[i].p = t;
        d >> A[i].kiek;
        d.ignore();
    }

    d.close();
}
void atrinkti(int n, manksta A[], manksta B[])
{
    bool exits;
    int m = 0;
    for (int i = 0; i < n; i++)
    {
        exits = false;
        for (int j = 0; j < m; j++)
        {
            if (A[i].p == B[j].p)
            {
                exits = true;
                B[j].kiek += A[i].kiek;
            }
        }
        if (!exits)
        {
            B[m].kiek = A[i].kiek;
            B[m].p = A[i].p;
            m++;
        }

    }
    for (int i = 0; i < m; i++)
    {
        if (B[i].kiek==1)
        {
            for (int j = i; j < m; j++)
            {
                B[j] = B[j+1];
            }
            m--;
        }
    }
    for (int z = 0; z < m; z++)
    {
        cout << B[z].p << " " << B[z].kiek << endl;
    }

}