Submission #1441515
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int n, m;
pi a[200005];
int main(){
scanf("%d %d",&n,&m);
for(int i=0; i<n; i++) scanf("%d",&a[i].first), a[i].second = 0;
for(int i=n; i<n+m; i++) scanf("%d",&a[i].first), a[i].second = 1;
sort(a, a+n+m);
int c1 = n+1, c2 = m+1;
lint ans = 0;
for(int i=0; i<n+m; i++){
if(a[i].second){
ans += 1ll * c1 * a[i].first;
c2--;
}
else{
ans += 1ll * c2 * a[i].first;
c1--;
}
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
C - Gr-idian MST |
User |
koosaga |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
575 Byte |
Status |
AC |
Exec Time |
41 ms |
Memory |
1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:11:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
./Main.cpp:12:65: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=0; i<n; i++) scanf("%d",&a[i].first), a[i].second = 0;
^
./Main.cpp:13:67: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=n; i<n+m; i++) scanf("%d",&a[i].first), a[i].second = 1;
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
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 |
39 ms |
1792 KB |
02.txt |
AC |
39 ms |
1792 KB |
03.txt |
AC |
39 ms |
1792 KB |
04.txt |
AC |
39 ms |
1792 KB |
05.txt |
AC |
39 ms |
1792 KB |
06.txt |
AC |
39 ms |
1792 KB |
07.txt |
AC |
39 ms |
1792 KB |
08.txt |
AC |
39 ms |
1792 KB |
09.txt |
AC |
39 ms |
1792 KB |
10.txt |
AC |
39 ms |
1792 KB |
11.txt |
AC |
38 ms |
1792 KB |
12.txt |
AC |
37 ms |
1792 KB |
13.txt |
AC |
41 ms |
1792 KB |
14.txt |
AC |
38 ms |
1792 KB |
15.txt |
AC |
39 ms |
1792 KB |
16.txt |
AC |
19 ms |
1024 KB |
17.txt |
AC |
19 ms |
1024 KB |
18.txt |
AC |
19 ms |
1024 KB |
19.txt |
AC |
19 ms |
1024 KB |
20.txt |
AC |
22 ms |
1792 KB |
21.txt |
AC |
30 ms |
1792 KB |
22.txt |
AC |
29 ms |
1792 KB |
23.txt |
AC |
39 ms |
1792 KB |
24.txt |
AC |
30 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 |