# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
7885 | | xhae | 카드 (GA8_card) | C++14 | | 0 ms | 1088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
int main(void)
{
int n;
scanf("%d", &n);
int data[3000];
for(int i = 0; i < n; i++) scanf("%d", data + i);
sort(data, data + n);
printf("%d\n", accumulate(data, data + n - 1, 0));
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |