From ec1c635c262900ab7e497d9ce27b2a4de9c60a27 Mon Sep 17 00:00:00 2001
From: KiritoTRw <3021577574@qq.com>
Date: Mon, 2 May 2016 13:52:51 +0800
Subject: [PATCH] Create 1092.cpp

---
 QUSTOJ/1092.cpp | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 QUSTOJ/1092.cpp

diff --git a/QUSTOJ/1092.cpp b/QUSTOJ/1092.cpp
new file mode 100644
index 0000000..2abc51f
--- /dev/null
+++ b/QUSTOJ/1092.cpp
@@ -0,0 +1,43 @@
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <algorithm>
+using namespace std;
+
+#define MAXN 50005
+struct pack
+{
+    long a,b,c;
+};
+pack PK[MAXN];
+int W[16];
+bool cmp(pack a,pack b){
+    return (a.a>b.a) || (a.a==b.a && a.c<b.c);
+}
+
+int main()
+{
+    int n,k;
+    scanf("%d %d",&n,&k);
+    for(int i=0;i<10;i++)
+    {
+        scanf("%d",&W[i]);
+    }
+    for(int i=0;i<n;i++)
+    {
+        scanf("%ld",&PK[i].a);
+        PK[i].c=i+1;
+    }
+    sort(PK,PK+n,cmp);
+    for (int i=0;i<n;i++){
+        PK[i].b=i;
+        PK[i].a+=W[PK[i].b%10];
+    }
+    sort(PK,PK+n,cmp);
+    for (int i=0;i<k;i++){
+        printf("%ld",PK[i].c);
+        if (i+1==k) printf("\n");
+        else printf(" ");
+    }
+    return 0;
+}