# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
7338 | | kriii | 카드 (GA8_card) | C++98 | | 0 ms | 1096 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 <stdio.h>
#include <algorithm>
int N,A[2222],S;
int main()
{
scanf ("%d",&N);
for (int i=0;i<N;i++) scanf ("%d",&A[i]);
std::sort(A,A+N);
for (int i=0;i<N-1;i++) S += A[i];
printf ("%d\n",S);
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... |