Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int solution(vector<int> &T)
- {
- int giveAwayCandies=T.size()/2, unique;
- sort(T.begin(),T.end());
- for(int i=1;i<T.size();i++)
- {
- if(T[i]==T[i-1])
- {
- T.erase(T.begin()+i-1);
- giveAwayCandies--;
- i--;
- }
- if(giveAwayCandies==0)break;
- int costam=T.size()-i;
- if(giveAwayCandies==T.size()-i)
- {
- T.erase(T.begin()+i,T.end());
- break;
- }
- }
- unique=T.size();
- for(int i=1;i<T.size();i++)
- {
- if(T[i]==T[i-1])unique--;
- }
- return unique;
- }
- int main()
- {
- vector<int> tab={80,80,1000000000,80,80,80,80,80,80,123456789};
- cout<<solution(tab);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement