Submission #1843447
Source Code Expand
#include <iostream> #include <cctype> #include <algorithm> #include <vector> #include <map> #include <queue> #include <set> #include <stack> #include <utility> #include <string> #include <functional> #include <cctype> #include <cstring> #include <cstdio> #include <cstdlib> #include <cmath> typedef long long ll; const int INF = 100000000, mod = 1000000007; const ll LLINF = 1LL << 50; using namespace std; int n, k, first, a[100005]; int main() { cin >> n >> k; cin >> first; for (int i = 0; i < n-1; i++) cin >> a[i]; sort(a, a + n, greater<int>()); int sum = (first + first + k - 1)*k / 2; int exists = first; for (int i = 0; i < k - 1; i++) exists += a[i]; cout << sum - exists << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Buildings are Colorful! |
User | otoko |
Language | C++14 (GCC 5.4.1) |
Score | 90 |
Code Size | 777 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 120 | 90 / 90 | 0 / 140 | ||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sub0_in1.txt, sub0_in2.txt |
Subtask1 | sub1_in1.txt, sub1_in2.txt |
Subtask2 | sub2_in1.txt, sub2_in2.txt, sub2_in3.txt |
Subtask3 | sub0_in1.txt, sub0_in2.txt, sub1_in1.txt, sub1_in2.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sub0_in1.txt | AC | 1 ms | 256 KB |
sub0_in2.txt | AC | 1 ms | 256 KB |
sub1_in1.txt | WA | 1 ms | 256 KB |
sub1_in2.txt | WA | 1 ms | 256 KB |
sub2_in1.txt | AC | 1 ms | 256 KB |
sub2_in2.txt | AC | 1 ms | 256 KB |
sub2_in3.txt | AC | 1 ms | 256 KB |
sub3_in1.txt | WA | 1 ms | 256 KB |
sub3_in2.txt | WA | 1 ms | 256 KB |