diff options
author | Santo Cariotti <dcariotti24@gmail.com> | 2020-04-05 11:33:43 +0200 |
---|---|---|
committer | Santo Cariotti <dcariotti24@gmail.com> | 2020-04-05 11:33:43 +0200 |
commit | ffa41b422937890c81e5d9e2dc5154db0a8b47bf (patch) | |
tree | d57277d7000b45f47f36c87048706c968d9f44c8 | |
parent | ad3a70038874d9ebecf887d9bb180fb8c89bb948 (diff) |
feat: add coding contest 04/04/2020
-rw-r--r-- | I_anno/Programmazione_2/dolcetti.cpp | 51 |
1 files changed, 51 insertions, 0 deletions
diff --git a/I_anno/Programmazione_2/dolcetti.cpp b/I_anno/Programmazione_2/dolcetti.cpp new file mode 100644 index 0000000..c3409a4 --- /dev/null +++ b/I_anno/Programmazione_2/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; +} + |