oj.uz

Submission #7357

# Submission time Handle Problem Language Result Execution time Memory
7357 2014-08-03T03:14:07 Z netsion 카드 (GA8_card) C++
100 / 100
 0 ms 1476 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;
struct ab
{
    int m;
}data[100000];
int aa(ab c,ab d)
{
    if(c.m<d.m) return 1;
    return 0;
}
int main()
{
    int i,j,n,tot=0;
    scanf("%d ",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d ",&data[i].m);
    }
    std::sort(data+1,data+1+n,aa);
    for(i=1;i<n;i++)
    {
        tot+=data[i].m;
    }
    printf("%d",tot);
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct
2 Correct 0 ms 1476 KB Output is correct
3 Correct 0 ms 1476 KB Output is correct
4 Correct 0 ms 1476 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct
2 Correct 0 ms 1476 KB Output is correct
3 Correct 0 ms 1476 KB Output is correct
4 Correct 0 ms 1476 KB Output is correct
5 Correct 0 ms 1476 KB Output is correct
6 Correct 0 ms 1476 KB Output is correct
7 Correct 0 ms 1476 KB Output is correct
8 Correct 0 ms 1476 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct
2 Correct 0 ms 1476 KB Output is correct
3 Correct 0 ms 1476 KB Output is correct
4 Correct 0 ms 1476 KB Output is correct
5 Correct 0 ms 1476 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1476 KB Output is correct
2 Correct 0 ms 1476 KB Output is correct
3 Correct 0 ms 1476 KB Output is correct
4 Correct 0 ms 1476 KB Output is correct
5 Correct 0 ms 1476 KB Output is correct
6 Correct 0 ms 1476 KB Output is correct
7 Correct 0 ms 1476 KB Output is correct
8 Correct 0 ms 1476 KB Output is correct
9 Correct 0 ms 1476 KB Output is correct
10 Correct 0 ms 1476 KB Output is correct
11 Correct 0 ms 1476 KB Output is correct
12 Correct 0 ms 1476 KB Output is correct
13 Correct 0 ms 1476 KB Output is correct
14 Correct 0 ms 1476 KB Output is correct
15 Correct 0 ms 1476 KB Output is correct
16 Correct 0 ms 1476 KB Output is correct
17 Correct 0 ms 1476 KB Output is correct
18 Correct 0 ms 1476 KB Output is correct
19 Correct 0 ms 1476 KB Output is correct
20 Correct 0 ms 1476 KB Output is correct
21 Correct 0 ms 1476 KB Output is correct
22 Correct 0 ms 1476 KB Output is correct