Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <iostream>
- #include <stdio.h>
- //#define W 7
- using namespace std;
- void input();
- void sorting();
- void output();
- int MaxPercent();
- int MinPercent();
- typedef struct{
- int day;
- int plan;
- int prod;
- double percent;
- }AN;
- AN an[7];
- int W;
- int main() {
- input();
- sorting();
- output();
- printf(" max percent of plan > %d%% \n min percent of plan > %d%%", MaxPercent(), MinPercent());
- getchar();
- getchar();
- }
- void input(){
- printf("enter working days >");
- scanf("%d",&W);
- printf("\n");
- for(int i = 0; i != W; i++){
- printf(" day > ");
- cin >> an[i].day;
- printf(" plan > ");
- cin >> an[i].plan;
- printf(" prod > ");
- cin >> an[i].prod;
- printf("\n");
- an[i].percent = ((double)an[i].prod/(double)an[i].plan)*100;
- }
- }
- void sorting()
- {
- for (int a = 0 ; a < W -1 ; a++) {
- int min = an[a].plan,z;
- for(int j=a+1;j < W;j++)
- {
- if (min > an[j].plan)
- {
- min = an[j].plan;
- z = j;
- }
- else z = a;
- }
- if(z != a)
- {
- AN temp = an[z];
- an[z]=an[a];
- an[a]=temp;
- }
- }
- }
- void output(){
- for(int i = 0; i!=W;i++){
- switch(an[i].day){
- case 1:printf("Day Mon");break;
- case 2:printf("Day Teu");break;
- case 3:printf("Day Wed");break;
- case 4:printf("Day Thu");break;
- case 5:printf("Day Fri");break;
- case 6:printf("Day Sut");break;
- case 7:printf("Day Sun");break;
- }
- printf(" \t plan for day %d \t amount of prod %d \n",an[i].plan, an[i].prod);
- }
- }
- int MaxPercent(){
- int max = an[0].percent;
- for(int i = 1; i!= W; i++){
- if(an[i].percent > max) max = an[i].percent;
- }
- return max;
- }
- int MinPercent(){
- int min = an[0].percent;
- for(int i = 1; i!= W; i++){
- if(an[i].percent < min) min = an[i].percent;
- }
- return min;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement