Submission #1244180


Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main(void) {

	int w, h;
	cin >> w >> h;
	vector< pair<int, bool> > edge(w + h, make_pair(0, true));
	for (int i = 0; i < w; ++i) {
		cin >> edge[i].first;
	}
	for (int i = w; i < w + h; ++i) {
		cin >> edge[i].first;
		edge[i].second = false;
	}
	sort(edge.begin(), edge.end());

	int sum = 0, x = w + 1, y = h + 1;
	for (int i = 0; i < edge.size(); ++i) {
		if (edge[i].second) {
			sum += edge[i].first * y;
			--x;
		} else {
			sum += edge[i].first * x;
			--y;
		}
	}

	cout << sum << endl;
	return 0;

}

Submission Info

Submission Time
Task C - Gr-idian MST
User indcn20171018
Language C++14 (GCC 5.4.1)
Score 0
Code Size 632 Byte
Status WA
Exec Time 94 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 6
WA × 24
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 90 ms 1792 KB
02.txt WA 90 ms 1792 KB
03.txt WA 89 ms 1792 KB
04.txt WA 90 ms 1792 KB
05.txt WA 90 ms 1792 KB
06.txt WA 94 ms 1792 KB
07.txt WA 90 ms 1792 KB
08.txt WA 90 ms 1792 KB
09.txt WA 90 ms 1792 KB
10.txt WA 89 ms 1792 KB
11.txt WA 88 ms 1792 KB
12.txt WA 88 ms 1792 KB
13.txt WA 92 ms 1792 KB
14.txt WA 88 ms 1792 KB
15.txt WA 88 ms 1792 KB
16.txt WA 45 ms 1024 KB
17.txt WA 45 ms 1024 KB
18.txt WA 45 ms 1024 KB
19.txt WA 45 ms 1024 KB
20.txt WA 37 ms 1792 KB
21.txt WA 62 ms 1792 KB
22.txt WA 62 ms 1792 KB
23.txt WA 75 ms 1792 KB
24.txt WA 85 ms 1792 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB