summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_2/dolcetti.cpp
diff options
context:
space:
mode:
authorSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
committerSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
commitc1b13da17b2d20bdb9392f0e390df771772f0020 (patch)
tree20f266a590a4bb36738355f54fd48f4229b58b05 /I_anno/Programmazione_2/dolcetti.cpp
parentbc8b5b446a6a2d37bae82e7ad20e31e1439a2f0b (diff)
chore: order in coding contest folder
Diffstat (limited to 'I_anno/Programmazione_2/dolcetti.cpp')
-rw-r--r--I_anno/Programmazione_2/dolcetti.cpp51
1 files changed, 0 insertions, 51 deletions
diff --git a/I_anno/Programmazione_2/dolcetti.cpp b/I_anno/Programmazione_2/dolcetti.cpp
deleted file mode 100644
index c3409a4..0000000
--- a/I_anno/Programmazione_2/dolcetti.cpp
+++ /dev/null
@@ -1,51 +0,0 @@
-#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;
-}
-