Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <malloc.h>
- #include <string.h>
- typedef struct
- {
- char nume[10];
- char prenume [10];
- int varsta;
- float salariu;
- }Angajat;
- typedef struct
- {
- char nume_dept[10];
- Angajat a[10];
- }Departament;
- void citire(int *n,Departament **d,int *nr[])
- {
- char v='d';
- char c;
- printf("Introduceti numarul de departamente:\n");
- scanf ("%d",n);
- *d=(Departament*)malloc((*n)*sizeof(Departament));
- for (int i=0;i<*n;i++)
- {
- printf("Numele departamentului %d este:\n",i+1);
- //printf("eroare1");
- scanf("%s",(*d)[i].nume_dept);
- int j=0;
- while(v=='d')
- {
- printf("Numele angajatului %d este:\n",j+1);
- scanf("%s",(*d)[i].a[j].nume);
- printf("Prenumele angajatului %d este:\n",j+1);
- scanf("%s",(*d)[i].a[j].prenume);
- printf("Varsta angajatului %d este:\n",j+1);
- scanf("%d",&(*d)[i].a[j].varsta);
- printf("Salariul angajatului %d este:\n",j+1);
- scanf("%f",&(*d)[i].a[j].salariu);
- printf("Mai adaugati un angajat?\n");
- scanf(" %c",&v);
- // (*nr)[i]=j-1;
- j++;
- printf("eroaare 2");
- }
- }
- }
- void maxim (int n,Departament *d,int nr[])
- {
- float s[n];
- int p=0,i;
- for (int i=0;i<n;i++)
- {
- s[i]=s[i]+d[i].a[nr[i]].salariu;
- }
- int max=s[0];
- for (i=0;i<n;i++)
- {
- if (max < s[i])
- {
- max=s[i];
- p=i;
- }
- }
- printf("Departamentul care are cele mai mari costuri este %s",d[p].nume_dept);
- }
- int main ()
- {
- int n;
- int j[10];
- int *nr;
- Departament *d;
- citire(&n,&d,&nr);
- maxim (n,d,nr);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement