Submission #2248914
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <set> #include <string> #include <stdio.h> #include <cmath> #include <limits.h> using namespace std; typedef long long ll; #define min(a, b) (((a) < (b))? (a):(b)) #define max(a, b) (((a) > (b))? (a):(b)) #define REP(i, a, n) for(int i=(a); i<(n); ++i) #define rep(i, n) REP(i, 0, (n)) #define square(a) (a)*(a) #define pb push_back int n,k,s,a[55]; int main(void) { int i; cin >> n >> k; for(i = 1;n>=i;i++) cin >> a[i]; sort(a,a+n); for(i = n-k+1;i<=n;i++)s += a[i]; cout << s; }
Submission Info
Submission Time | |
---|---|
Task | B - Snake Toy |
User | es135 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 607 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |