Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- void skaitymas(int M[], int K[], int N[], int &n, int &k, int &m);
- void salinimas(int N[], int l, int &n);
- void iterpimas(int N[], int l, int x, int &n);
- void rasymas (int N[], int n);
- int main()
- {
- int M[100]={0}, K[100]={0}, N[100]={0}, n, k, m, l=0, x;
- skaitymas(M,K,N,n,k,m);
- for(int i = 0 ; i < n; i++)
- {
- for (int j = 0 ; j < m; j++)
- {
- if(N[i]==M[j])
- {
- salinimas(N, i, n);
- i--;
- }
- }
- }
- for (int j = 0 ; j < k; j++)
- {
- if(N[n-1] < K[j])
- {
- x = K[j];
- iterpimas(N, n, x, n);
- break;
- }
- }
- for(int i = 0 ; i < n; i++)
- {
- for (int j = 0 ; j < k; j++)
- {
- if(N[i]>=K[j])
- {
- x = K[j];
- // cout << x << endl;
- iterpimas(N, i, x, n);
- break;
- }
- }
- }
- rasymas(N,n);
- }
- void skaitymas(int M[], int K[], int N[], int &n, int &k, int& m)
- {
- ifstream duota ("duota.txt");
- duota >> n;
- for(int i = 0; i < n; i++)
- {
- duota >> N[i];
- }
- duota >> m;
- for(int i = 0; i < m; i++)
- {
- duota >> M[i];
- }
- duota >> k;
- for(int i = 0; i < k; i++)
- {
- duota >> K[i];
- }
- duota.close();
- }
- void salinimas(int N[], int l, int &n)
- {
- for (int i = l; i < n-1; i++)
- N[i]=N[i+1];
- n--;
- }
- void iterpimas(int N[], int l, int x, int &n)
- {
- n++;
- for (int i = n-1; i > l; i--)
- N[i]=N[i-1];
- N[l] = x;
- }
- void rasymas(int N[], int n)
- {
- ofstream rez("rezultatai,txt");
- for (int i = 0; i< n; i ++)
- rez << N[i] << endl;
- rez.close();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement