Swayamwar program

#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main()
{
int n, k = 0, m = 0;
cout << "enter no of bride's and groom's: ";
cin >> n;
char temp;
queue<char> bride, groom;
cout << "enter the string of brides with lower case: ";
for (int i = 0; i < n; i++)
{
cin >> temp;
bride.push(temp);
}
cout << "enter the string of grooms with lower case: ";
for (int i = 0; i < n; i++)
{
cin >> temp;
groom.push(temp);
}
char c = bride.front();
while (bride.size() > 0)
{
if (bride.front() != groom.front())
{
if (bride.front() == c)
m++;
else
m = 0;
if (bride.front() == c && m > n)
{
break;
}
groom.push(groom.front());
groom.pop();
}
else
{
groom.pop();
bride.pop();
c = bride.front();
m = 0;
}
}
cout << "No of pairs left unmatched" << bride.size() << endl;
return 0;
}

digit pair program

#include <iostream>
using namespace std;
int main()
{
 int n, temp, r, max, min, sum;
cout << "enter no of elements: ";
cin >> n;
int vec[n];
cout << "enter the" << n << "number of three digit numbers" << endl;
for (int i = 0; i < n; i++)
{
cout << "enter " << i << " ele:" << endl;
cin >> vec[i];
}
for (int i = 0; i < n; i++)
{
temp = vec[i];
max = 0;
min = 9;
while (temp != 0)
{
r = temp % 10;
if (r > max)
max = r;
if (r < min)
min = r;
temp = temp / 10;
}
sum = (max * 11) + (min * 7);
if (sum <= 99)
vec[i] = sum;
else
{
r = sum % 100;
vec[i] = r;
}
}
int pair = 0;
for (int i = 0; i < n; i++)
{
temp = vec[i] % 10;
vec[i] = (vec[i] - temp) / 10;
}
for (int i = 0; i < n; i++)
{
for (int j = i + 2; j < n; j = j + 2)
{
if (vec[j] == 0)
break;
if (vec[i] == vec[j])
{
pair++;
vec[j] = 0;
}
}
}
cout << "No of pairs are: " << pair << endl;
return 0;
}

petrol pump program

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, i, d, v1 = 0, v2 = 0, j = 0, k = 0;
cout << "enter number of vehicles: ";
cin >> n;
int arr[n], arr1[n], arr2[n], arr3[n];
for (i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n, greater<int>());
for (i = 0; i < n; i++)
{
if (v1 < v2)
{
arr1[j] = arr[i];
v1 = v1 + arr[i];
j++;
}
else
{
arr2[k] = arr[i];
v2 = v2 + arr[i];
k++;
}
}
int f = (j < k) ? j : k, h;
if (v1 < v2)
d = v2 - v1;
else
d = v1 - v2;
for (i = 0; i < f; i++)
{
arr3[i] = arr1[i] - arr2[i];
}
for (int i = 0; i < f; i++)
{
if (arr3[i] == -d)
{
swap(arr1[i], arr2[i]);
break;
}
if (i == f - 1)
{
d--;
i = 0;
}
}
v1 = 0;
v2 = 0;
for (i = 0; i < j; i++)
v1 += arr1[i];
for (i = 0; i < k; i++)
v2 += arr2[i];
if (v1 < v2)
cout << v2;
else
cout << v1;
 return 0;
}