Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- #include <string>
- #include <set>
- #include <map>
- #include <algorithm>
- #include <string>
- #include <math.h>
- #include <vector>
- using namespace std;
- struct soviet
- {
- int people, yes;
- };
- bool d(soviet p1, soviet p2)
- {
- return p1.people < p2.people;
- }
- int main()
- {
- int k, people, yes = 0, sum = 0;
- soviet soviets[102];
- cin >> k;
- for (int i = 1; i <= k; i++)
- {
- cin >> people;
- soviets[i].people = people;
- soviets[i].yes = people / 2 + 1;
- }
- sort(soviets + 1, soviets + k + 1, d);
- people = 0;
- for (int i = 1; i <= ceil(1.0*k/2*1.0); i++)
- {
- people = people + soviets[i].people;
- yes = yes + soviets[i].yes;
- }
- cout << yes;
- _getch();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement