From 0e83e57016a2c21bd4de9dc0b362943d5f79321c Mon Sep 17 00:00:00 2001
From: Kirito <1362050620@qq.com>
Date: Sun, 22 May 2016 15:40:28 +0800
Subject: [PATCH] Create 1498_2868647513.cpp

From https://vijos.org/p/1498/solution
---
 VIJOS/1498_2868647513.cpp | 58 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 VIJOS/1498_2868647513.cpp

diff --git a/VIJOS/1498_2868647513.cpp b/VIJOS/1498_2868647513.cpp
new file mode 100644
index 0000000..5741618
--- /dev/null
+++ b/VIJOS/1498_2868647513.cpp
@@ -0,0 +1,58 @@
+#include<iostream>
+#include<cstdio>
+#include<algorithm>
+using namespace std;
+struct zong{
+    int sum,num;
+}y[2001];
+struct heng{
+    int sum,num;
+}x[2001];
+int dog(const zong&a,const zong&b)
+{
+    return a.sum>b.sum;
+}
+int cat(const heng&a,const heng&b)
+{
+    return a.sum>b.sum;
+}
+int tiger(const zong&a,const zong&b)
+{
+    return a.num<b.num;
+}
+int sheep(const heng&a,const heng&b)
+{
+    return a.num<b.num;
+}
+int main()
+{
+    int m,n,k,l,d,x1,y1,x2,y2,i;
+    scanf("%d%d%d%d%d",&m,&n,&k,&l,&d);
+    for(i=1;i<=m;i++){
+        x[i].num=i;
+    }
+    for(i=1;i<=n;i++){
+        y[i].num=i;
+    }
+    for(i=1;i<=d;i++){
+        scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
+        if(x1==x2){
+            y[y1<y2?y1:y2].sum++;
+        }
+        else{
+            x[x1<x2?x1:x2].sum++;
+        }
+    }
+    sort(x+1,x+m+1,cat);
+    sort(y+1,y+n+1,dog);
+    sort(x+1,x+k+1,sheep);
+    sort(y+1,y+l+1,tiger);
+    for(i=1;i<=k;i++){
+        printf("%d ",x[i].num);
+    }
+    printf("\n");
+    for(i=1;i<=l;i++){
+        printf("%d ",y[i].num);
+    }
+    return 0;
+}