-
Notifications
You must be signed in to change notification settings - Fork 0
/
MissingNumbers.cpp
94 lines (82 loc) · 1.77 KB
/
MissingNumbers.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int A[1000000];
int B[1000000];
int aux1[101];
bool check[1000000];
int aux2[101];
void swaps(int pos_a,int pos_b, int arr[])
{
int tmp = arr[pos_a];
arr[pos_a] = arr[pos_b];
arr[pos_b] = tmp;
}
void insertionSort(int ar[],int sizis)
{
for(int i = 1; i < sizis;i++ )
{
int key = ar[i];
int j = i - 1;
while (j >= 0 && ar[j]> key)
{
ar[j+1] = ar[j];
j--;
}
ar[j + 1] = key;
}
}
int main()
{
int N,T = 0;
cin>> T;
int temp = 0;
for(int i = 0 ; i < T;i++)
{
cin>>temp;
// aux1[i] = temp;
A[temp]++;
}
// aux2[N];
cin>>N;
int smallest = 0;
for(int i = 0 ; i < N;i++)
{
cin>>temp;
if(smallest == 0 || smallest > temp)
smallest = temp;
// aux2[i] = temp;
B[temp]++;
}
// insertionSort(aux1,T);
// insertionSort(aux2,N);
/* for(int i =0; i<=N;i++)
{
// cout<<A[i]<< " "<<B[i]<<endl;
if(A[aux2[i]] != B[aux2[i]] && !check[aux2[i]])
{
cout<<aux2[i]<<" ";
check[aux2[i]] = true;
}
if(A[aux1[i]] != B[aux1[i]] && !check[aux1[i]])
{
cout<<aux1[i]<<" ";
check[aux1[i]] = true;
}
}
*/
for(int i =smallest; i<=smallest+100;i++)
{
// cout<<A[i]<< " "<<B[i]<<endl;
if(A[i] != B[i] && !check[i % 100])
{
cout<<i<<" ";
check[i% 100] = true;
}
}
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;
}