Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define MAX 15
- int main()
- {
- int b, g, i, sorditud, a;
- printf("Enter the number of boys: \n");
- scanf("%d", &b);
- printf("Enter the number of girls: \n");
- scanf("%d", &g);
- if(b > MAX || g > MAX)
- {
- printf("The maximum number of boys is 15 and the maximum number of girls is 15. \n");
- return -1;
- }
- int boys[b];
- int girls[g];
- for(i = 0; i < b; i++)
- {
- printf("Enter the height of boy nr %d: \n", i+1);
- scanf("%d", &boys[i]);
- }
- for(i = 0; i < g; i++)
- {
- printf("Enter the height of girl nr %d: \n", i+1);
- scanf("%d", &girls[i]);
- }
- printf("Boys: ");
- for(i = 0; i < b; i++)
- {
- printf("%d", boys[i]);
- if(i < b - 1)
- printf(", ");
- }
- printf("\nGirls: ");
- for(i = 0; i < g; i++)
- {
- printf("%d", girls[i]);
- if(i < g - 1)
- printf(", ");
- }
- if(b == g){
- do
- {
- sorditud = 1;
- for(i = 0; i < b - 1; i++)
- if(boys[i] > boys[i + 1])
- {
- a = boys[i];
- boys[i] = boys[i + 1];
- boys[i + 1] = a;
- sorditud = 0;
- }
- }
- while(!sorditud);
- do
- {
- sorditud = 1;
- for(i = 0; i < g - 1; i++)
- if(girls[i] > girls[i + 1])
- {
- a = girls[i];
- girls[i] = girls[i + 1];
- girls[i + 1] = a;
- sorditud = 0;
- }
- }
- while(!sorditud);
- printf("\nSorted boys: ");
- for(i = 0; i < b; i++)
- printf("%d, ", boys[i]);
- printf("\nSorted girls: ");
- for(i = 0; i < g; i++)
- printf("%d, ", girls[i]);
- }
- else if(b < g){
- do
- {
- sorditud = 1;
- for(i = 0; i < b - 1; i++)
- if(boys[i] > boys[i + 1])
- {
- a = boys[i];
- boys[i] = boys[i + 1];
- boys[i + 1] = a;
- sorditud = 0;
- }
- }
- while(!sorditud);
- do
- {
- sorditud = 1;
- for(i = 0; i < g - 1; i++)
- if(girls[i] > girls[i + 1])
- {
- a = girls[i];
- girls[i] = girls[i + 1];
- girls[i + 1] = a;
- sorditud = 0;
- }
- }
- while(!sorditud);
- printf("\nSorted boys: ");
- for(i = 0; i < b; i++)
- printf("%d, ", boys[i]);
- printf("\nSorted girls: ");
- for(i = 0; i < g; i++)
- printf("%d, ", girls[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement