Submission #1369362


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;

typedef pair<int,int> P;

signed main(){
	int w,h,p[100000],q[100000],ans = 0;
	int tat = 0,yok = 0;
	vector<P> vec;
	cin >> w >> h;
	for(int i = 0;i < w;i++) {
		cin >> p[i];
		vec.push_back(P(p[i],i));
	}
	for(int i = 0;i < h;i++) {
		cin >> q[i];
		vec.push_back(P(q[i],i + w));
	}
	sort(vec.begin(),vec.end());
	for(int i = 0;i < h + w;i++){
		int cost = vec[i].first,v = vec[i].second;
		bool dir = v >= w;
		if(dir) {
			v -= w;
			ans += cost * (w + 1 - tat);
			yok++;
		}else{
			ans += cost * (h + 1 - yok);
			tat++;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Gr-idian MST
User hoget157
Language C++14 (GCC 5.4.1)
Score 500
Code Size 708 Byte
Status AC
Exec Time 97 ms
Memory 7536 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 30
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 AC 92 ms 6128 KB
02.txt AC 92 ms 6640 KB
03.txt AC 92 ms 6384 KB
04.txt AC 92 ms 5872 KB
05.txt AC 92 ms 6768 KB
06.txt AC 92 ms 6896 KB
07.txt AC 97 ms 6768 KB
08.txt AC 92 ms 5872 KB
09.txt AC 91 ms 6512 KB
10.txt AC 92 ms 6768 KB
11.txt AC 91 ms 6896 KB
12.txt AC 90 ms 5488 KB
13.txt AC 94 ms 6256 KB
14.txt AC 91 ms 7536 KB
15.txt AC 92 ms 7408 KB
16.txt AC 46 ms 2932 KB
17.txt AC 46 ms 2932 KB
18.txt AC 47 ms 2932 KB
19.txt AC 46 ms 2932 KB
20.txt AC 41 ms 6128 KB
21.txt AC 66 ms 5616 KB
22.txt AC 66 ms 6640 KB
23.txt AC 78 ms 7280 KB
24.txt AC 90 ms 5488 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