Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Example program
- #include <iostream>
- #include <string>
- #include <set>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int sockMerchant(int n, vector<int> ar) {
- vector<int> vect;
- int counter = 0;
- for(int i =0; i <n ; i++)
- {
- //cout << i << " " << ar[i] << endl;
- /*
- if(count(vect.begin(), vect.end(), ar[i]) ==2)
- {
- counter++;
- }
- */
- vect.push_back(ar[i]);
- }
- set<int> s1;
- for(int i =0; i <n ; i++)
- {
- int number = vect[i];
- int times = count(vect.begin(), vect.end(), ar[i]);
- cout << i << " " << number << " " << times << " " << counter <<endl;
- if(count(s1.begin(), s1.end(), ar[i]) ==0)
- {
- counter += times/2;
- }
- s1.insert(vect[i]);
- }
- return counter;
- }
- int main()
- {
- /* vector <int> v1 { 10, 20, 20, 10, 10, 30, 50, 10, 20 };
- int res = sockMerchant(9, v1);.
- */
- sockMerchant(
- cout << res << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement