Pagini recente » Cod sursa (job #457247) | Cod sursa (job #834507) | Cod sursa (job #2280857) | Cod sursa (job #2026827) | Cod sursa (job #1820419)
#include <algorithm>
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream in("aria.in");
ofstream out("aria.out");
const int maxn = 100005;
pair <double, double> v[maxn];
inline double det(double x1, double y1, double x2, double y2)
{
double x = x1 * y2 - x2 * y1;
return x / 2.0;
}
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i].first >> v[i].second;
v[n + 1] = v[1];
//sort(v + 1, v + n + 2);
double sum = 0;
for(int i = 1; i <= n; i++)
sum += det(v[i].first, v[i].second, v[i + 1].first, v[i + 1].second);
out << setprecision(6) << fixed << sum << "\n";
return 0;
}