oj.uz

Submission #706597

# Submission time Handle Problem Language Result Execution time Memory
706597 2023-03-07T06:26:32 Z YugiHacker Unija (COCI17_unija) C++14
100 / 100
 302 ms 23256 KB 
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 1000006
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
int n;
pair<int, int> a[maxn];
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    f1 (i, n) cin >> a[i].fi >> a[i].se;
    sort(a+1, a+n+1);
    long long ans = 0;
    int maSe = 0;
    for (int i=n; i; i--)
    {
        maSe = max(maSe, a[i].se);
        ans += 1ll*(a[i].fi-a[i-1].fi) * maSe;
    }
    cout << ans;
}

Compilation message

unija.cpp:12:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   12 | main()
      | ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 23100 KB Output is correct
2 Correct 262 ms 23256 KB Output is correct
3 Correct 255 ms 23040 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 928 KB Output is correct
2 Correct 8 ms 852 KB Output is correct
3 Correct 7 ms 852 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2300 KB Output is correct
2 Correct 25 ms 2512 KB Output is correct
3 Correct 30 ms 2436 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 6640 KB Output is correct
2 Correct 71 ms 6620 KB Output is correct
3 Correct 76 ms 6704 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 23100 KB Output is correct
2 Correct 252 ms 23020 KB Output is correct
3 Correct 302 ms 23104 KB Output is correct