From c1b13da17b2d20bdb9392f0e390df771772f0020 Mon Sep 17 00:00:00 2001
From: Santo Cariotti <dcariotti24@gmail.com>
Date: Fri, 29 May 2020 17:37:43 +0200
Subject: chore: order in coding contest folder

---
 .../Programmazione_2/coding_contest/dolcetti.cpp   | 51 ++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 I_anno/Programmazione_2/coding_contest/dolcetti.cpp

(limited to 'I_anno/Programmazione_2/coding_contest/dolcetti.cpp')

diff --git a/I_anno/Programmazione_2/coding_contest/dolcetti.cpp b/I_anno/Programmazione_2/coding_contest/dolcetti.cpp
new file mode 100644
index 0000000..c3409a4
--- /dev/null
+++ b/I_anno/Programmazione_2/coding_contest/dolcetti.cpp
@@ -0,0 +1,51 @@
+#include<iostream>
+#include<fstream>
+#include<queue>
+#include<vector>
+
+using namespace std;
+
+int main() {
+    using tii = tuple<int, int, int>;
+    ifstream in("input.txt");
+    ofstream out("output.txt");
+
+    for(int ts = 0; ts < 100; ++ts) {
+        int N;
+        in >> N;
+
+        priority_queue<tii, vector<tii>> pq;
+        tii qq;
+        for(int i = 0; i < N; ++i) {
+            int e1, e2;
+            in >> e1 >> e2;
+            get<0>(qq) = e1-e2;
+            get<1>(qq) = e1;
+            get<2>(qq) = e2;
+
+            pq.push(qq);
+        }
+        
+        int counter = N;
+        int sum{};
+
+        while(counter-- > N/2) {
+            qq = pq.top();
+            sum += get<1>(qq);
+            pq.pop();
+        }
+
+        while(!pq.empty()) {
+            qq = pq.top();
+            sum += get<2>(qq);
+            pq.pop();
+        }
+
+        out << sum << endl;
+    }
+
+    in.close();
+    out.close();
+    return 0;
+}
+
-- 
cgit v1.2.3-18-g5258