25 lines
469 B
C++
25 lines
469 B
C++
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
|
|
const int N = 110;
|
|
int a[N] = {1, 2, 3, 6, 3};
|
|
int b[N] = {3, 4, 1, 6, 5};
|
|
int n = 5;
|
|
int k1 = 2, k2 = 3, k = k1 + k2;
|
|
long long res;
|
|
|
|
int main() {
|
|
// priority_queue<int> pq;
|
|
priority_queue<int, vector<int>, greater<int>> xq;
|
|
xq.push(1);
|
|
xq.push(4);
|
|
xq.push(8);
|
|
xq.push(10);
|
|
|
|
while (xq.size()) {
|
|
cout << xq.top() << endl;
|
|
xq.pop();
|
|
}
|
|
|
|
return 0;
|
|
} |