J. Parallelograms

最新推荐文章于 2020-04-07 21:12:51 发布

nsu_zser

最新推荐文章于 2020-04-07 21:12:51 发布

阅读量175

点赞数

分类专栏：题解文章标签： codeforces

本文链接：https://blog.csdn.net/qq_39485390/article/details/80048358

版权

题解专栏收录该内容

12 篇文章 0 订阅

订阅专栏

http://http://codeforces.com/gym/101755/problem/J

There are n sticks, the i-th of which has length a_i. Alex wants to assemble from them as many parallelograms as possible simultaneously, with each stick used at most in one parallelogram. What maximal number of parallelograms is it possible to assemble?

Input

The first line contains a single integer n (1 ≤ n ≤ 200000) — the number of sticks.

The second line contains n integers a_i (1 ≤ a_i ≤ 200000) — the lengths of sticks.

Output

Output a single integer — the maximal number of parallelograms that is possible to assemble.

        Examples 
      
          input 
         
           Copy 
         
4
1 2 1 2

          output 
         
           Copy 
         
1

          input 
         
           Copy 
         
12
1 3 5 7 1 3 5 7 1 3 5 7

          output 
         
           Copy 
         
2

题意，给你n条边，问你能同时组成多少个平行四边形。

两条相同的边为一组，如果有sum组，那么就能组成sum/2个平行四边形

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <map>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#include <ctime>
#include <stack>
#define MM 46400
using namespace std;
typedef long long ll;
int main()
{
    int n,a[200010];
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+1+n);
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==a[i+1])
        {
            i++;
            cnt++;
        }
    }
    printf("%d\n",cnt/2);
    return 0;
}