# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
7889 | | Qwaz | 카드 (GA8_card) | C++14 | | 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 <cstdio>
const int MAX = 2300;
int n, data[MAX], sum, maxNum;
void input(){
scanf("%d", &n);
int i;
for(i = 0; i<n; i++){
scanf("%d", &data[i]);
if(maxNum < data[i])
maxNum = data[i];
sum += data[i];
}
}
int main(){
input();
printf("%d\n", sum-maxNum);
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... |