Pagini recente » Borderou de evaluare (job #750420) | Cod sursa (job #3304698) | Cod sursa (job #3351679) | Cod sursa (job #1363859) | Cod sursa (job #2674063)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin("secventa.in");
ofstream fout("secventa.out");
vector<int> v;
int n,i,k,p=0,x,maxi=0;
fin>>n>>k;
for(i=0;i<n;i++)
{
fin>>x;
v.push_back(x);
}
for(i=0;i<n;i++)
{
if(v[i]>maxi && i+k<=n)
{
p=i;
maxi=v[i];
}
}
for(i=p;i<p+k;i++)
fout<<v[i]<<" ";
return 0;
}