3. Varžtai ir veržlės. (Vad 73psl.)

/*
8
8 4 2 8 10 5 4 5
10
2 2 2 5 5 4 4 4 2 4
*/

#include <iostream>
#include <fstream>
using namespace std;
const char duomF[] = "1.txt";
const char rezF[] = "rez1.txt";
const int CMax = 101;

struct varztai
{
    int varztas; // Varztu skersmenys
    int verzle; // Verzliu skersmenys
};

void skaitymas(varztai A[], int &n, int &m)
{
    ifstream df(duomF);
    int temp;

    df >> n;
    for (int i = 0; i < n; i++) {df >> temp; A[temp].varztas++;}

    df >> m;
    for (int i = 0; i < m; i++) {df >> temp; A[temp].verzle++;}

    df.close();
}

void reset(varztai A[])
{
    for (int i = 0; i < 101; i++) {A[i].varztas = 0; A[i].verzle = 0;}
}

void skaiciavimai(varztai A[], int n, int m)
{
    ofstream rf(rezF);

    rf << "Reikalingi varztai: " << endl;
    for (int i = 0; i < 101; i++) {if(A[i].verzle > A[i].varztas) rf << A[i].verzle - A[i].varztas << " " << i << endl;}
    rf << "Reikalingos varzles: " << endl;
    for (int i = 0; i < 101; i++) {if(A[i].varztas > A[i].verzle) rf << A[i].varztas - A[i].verzle << " " << i << endl;}

    rf.close();
}

int main ()
{
    varztai A[CMax];
    int n; int m;

    reset(A);
    skaitymas(A, n, m);
    skaiciavimai(A, n, m);

    return 0;
}